./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:10:15,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:10:15,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:10:15,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:10:15,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:10:15,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:10:15,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:10:15,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:10:15,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:10:15,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:10:15,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:10:15,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:10:15,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:10:15,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:10:15,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:10:15,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:10:15,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:10:15,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:10:15,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:10:15,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:10:15,602 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:10:15,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:10:15,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:10:15,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:10:15,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:10:15,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:10:15,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:10:15,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:10:15,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:10:15,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:10:15,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:10:15,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:10:15,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:10:15,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:10:15,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:10:15,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:10:15,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:10:15,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:10:15,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:10:15,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:10:15,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:10:15,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:10:15,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:10:15,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:10:15,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:10:15,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:10:15,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:10:15,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:10:15,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:10:15,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:10:15,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:10:15,658 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:10:15,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:10:15,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:10:15,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:10:15,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:10:15,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:10:15,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:10:15,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:10:15,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:10:15,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:10:15,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:10:15,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:10:15,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:10:15,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:10:15,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:10:15,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:10:15,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:10:15,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:10:15,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:10:15,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:10:15,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:10:15,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:10:15,664 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:10:15,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:10:15,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:10:15,665 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2022-07-13 21:10:15,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:10:15,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:10:15,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:10:15,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:10:15,943 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:10:15,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-07-13 21:10:16,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b341dfc93/0071beb09640407bbf976f0db3001d89/FLAG686bfbe8a [2022-07-13 21:10:16,437 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:10:16,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-07-13 21:10:16,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b341dfc93/0071beb09640407bbf976f0db3001d89/FLAG686bfbe8a [2022-07-13 21:10:16,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b341dfc93/0071beb09640407bbf976f0db3001d89 [2022-07-13 21:10:16,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:10:16,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:10:16,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:10:16,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:10:16,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:10:16,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:10:16" (1/1) ... [2022-07-13 21:10:16,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fb3b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:16, skipping insertion in model container [2022-07-13 21:10:16,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:10:16" (1/1) ... [2022-07-13 21:10:16,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:10:16,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:10:17,047 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/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-07-13 21:10:17,084 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/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-07-13 21:10:17,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:10:17,114 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:10:17,124 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/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2022-07-13 21:10:17,142 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/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2022-07-13 21:10:17,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:10:17,172 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:10:17,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17 WrapperNode [2022-07-13 21:10:17,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:10:17,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:10:17,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:10:17,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:10:17,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,233 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2022-07-13 21:10:17,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:10:17,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:10:17,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:10:17,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:10:17,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:10:17,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:10:17,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:10:17,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:10:17,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (1/1) ... [2022-07-13 21:10:17,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:10:17,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:17,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:10:17,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:10:17,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:10:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 21:10:17,356 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 21:10:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 21:10:17,357 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 21:10:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-13 21:10:17,358 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-13 21:10:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-13 21:10:17,358 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-13 21:10:17,359 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-13 21:10:17,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-13 21:10:17,359 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-13 21:10:17,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-13 21:10:17,359 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-13 21:10:17,359 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-13 21:10:17,359 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-13 21:10:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-13 21:10:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 21:10:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 21:10:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-13 21:10:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-13 21:10:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-13 21:10:17,360 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-13 21:10:17,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:10:17,361 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-13 21:10:17,361 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-13 21:10:17,361 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-13 21:10:17,361 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-13 21:10:17,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:10:17,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:10:17,361 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-13 21:10:17,362 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-13 21:10:17,362 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-13 21:10:17,362 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-13 21:10:17,472 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:10:17,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:10:17,931 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:10:17,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:10:17,939 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-13 21:10:17,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:17 BoogieIcfgContainer [2022-07-13 21:10:17,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:10:17,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:10:17,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:10:17,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:10:17,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:10:16" (1/3) ... [2022-07-13 21:10:17,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b60713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:10:17, skipping insertion in model container [2022-07-13 21:10:17,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:10:17" (2/3) ... [2022-07-13 21:10:17,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b60713b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:10:17, skipping insertion in model container [2022-07-13 21:10:17,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:17" (3/3) ... [2022-07-13 21:10:17,953 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-07-13 21:10:17,966 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:10:17,966 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:10:18,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:10:18,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d4adee9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d79b036 [2022-07-13 21:10:18,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-13 21:10:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 21:10:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:10:18,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:18,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:18,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:18,068 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-07-13 21:10:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:18,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006135172] [2022-07-13 21:10:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:18,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:18,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006135172] [2022-07-13 21:10:18,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006135172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:18,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:18,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920448331] [2022-07-13 21:10:18,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:18,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:18,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:18,451 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:19,289 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2022-07-13 21:10:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:10:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:10:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:19,312 INFO L225 Difference]: With dead ends: 552 [2022-07-13 21:10:19,312 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 21:10:19,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:19,322 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:19,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 794 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 21:10:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2022-07-13 21:10:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-07-13 21:10:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2022-07-13 21:10:19,385 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2022-07-13 21:10:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:19,386 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2022-07-13 21:10:19,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2022-07-13 21:10:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:10:19,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:19,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:10:19,390 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-07-13 21:10:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:19,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717081221] [2022-07-13 21:10:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:19,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717081221] [2022-07-13 21:10:19,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717081221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:19,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133526518] [2022-07-13 21:10:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:19,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:19,496 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:20,223 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2022-07-13 21:10:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:10:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:10:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:20,227 INFO L225 Difference]: With dead ends: 651 [2022-07-13 21:10:20,227 INFO L226 Difference]: Without dead ends: 456 [2022-07-13 21:10:20,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:10:20,230 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:20,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 918 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-07-13 21:10:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2022-07-13 21:10:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-07-13 21:10:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2022-07-13 21:10:20,262 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2022-07-13 21:10:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:20,263 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2022-07-13 21:10:20,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2022-07-13 21:10:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:10:20,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:20,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:20,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:10:20,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-07-13 21:10:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:20,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430295447] [2022-07-13 21:10:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:20,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430295447] [2022-07-13 21:10:20,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430295447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:20,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:20,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698920719] [2022-07-13 21:10:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:20,349 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:21,172 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2022-07-13 21:10:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:10:21,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:10:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:21,177 INFO L225 Difference]: With dead ends: 1002 [2022-07-13 21:10:21,177 INFO L226 Difference]: Without dead ends: 717 [2022-07-13 21:10:21,178 INFO L412 NwaCegarLoop]: 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 [2022-07-13 21:10:21,180 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 530 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:21,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1134 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-13 21:10:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2022-07-13 21:10:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-07-13 21:10:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2022-07-13 21:10:21,229 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2022-07-13 21:10:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:21,229 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2022-07-13 21:10:21,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2022-07-13 21:10:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:10:21,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:21,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:21,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:10:21,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2022-07-13 21:10:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098092675] [2022-07-13 21:10:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:21,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098092675] [2022-07-13 21:10:21,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098092675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:21,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:21,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235611071] [2022-07-13 21:10:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:21,334 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:21,971 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2022-07-13 21:10:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:10:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:21,976 INFO L225 Difference]: With dead ends: 1182 [2022-07-13 21:10:21,976 INFO L226 Difference]: Without dead ends: 723 [2022-07-13 21:10:21,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:10:21,978 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:21,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 977 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-07-13 21:10:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2022-07-13 21:10:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-07-13 21:10:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2022-07-13 21:10:22,040 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2022-07-13 21:10:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:22,041 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2022-07-13 21:10:22,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2022-07-13 21:10:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 21:10:22,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:22,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:22,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:10:22,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2022-07-13 21:10:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:22,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188632263] [2022-07-13 21:10:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:22,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188632263] [2022-07-13 21:10:22,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188632263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:22,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:22,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528097966] [2022-07-13 21:10:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:22,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:22,158 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:23,172 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2022-07-13 21:10:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 21:10:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-07-13 21:10:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:23,184 INFO L225 Difference]: With dead ends: 2468 [2022-07-13 21:10:23,185 INFO L226 Difference]: Without dead ends: 1994 [2022-07-13 21:10:23,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:10:23,193 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 1041 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:23,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 955 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 21:10:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-07-13 21:10:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2022-07-13 21:10:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-07-13 21:10:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2022-07-13 21:10:23,328 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2022-07-13 21:10:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:23,330 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2022-07-13 21:10:23,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 21:10:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2022-07-13 21:10:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:23,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:23,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:10:23,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-07-13 21:10:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175860948] [2022-07-13 21:10:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:23,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175860948] [2022-07-13 21:10:23,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175860948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:23,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:23,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385808023] [2022-07-13 21:10:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:23,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:23,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:23,439 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:24,014 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2022-07-13 21:10:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 21:10:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:24,022 INFO L225 Difference]: With dead ends: 1962 [2022-07-13 21:10:24,023 INFO L226 Difference]: Without dead ends: 1874 [2022-07-13 21:10:24,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:10:24,025 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 543 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:24,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 825 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-07-13 21:10:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2022-07-13 21:10:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-07-13 21:10:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2022-07-13 21:10:24,143 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2022-07-13 21:10:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:24,143 INFO L495 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2022-07-13 21:10:24,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2022-07-13 21:10:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:24,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:24,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:24,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:10:24,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-07-13 21:10:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:24,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817244503] [2022-07-13 21:10:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:24,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:24,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817244503] [2022-07-13 21:10:24,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817244503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:24,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:24,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932937098] [2022-07-13 21:10:24,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:24,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:24,220 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:24,975 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2022-07-13 21:10:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:10:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:24,984 INFO L225 Difference]: With dead ends: 2182 [2022-07-13 21:10:24,985 INFO L226 Difference]: Without dead ends: 2005 [2022-07-13 21:10:24,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:10:24,988 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 706 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:24,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1088 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:10:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-07-13 21:10:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2022-07-13 21:10:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-07-13 21:10:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2022-07-13 21:10:25,111 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2022-07-13 21:10:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:25,112 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2022-07-13 21:10:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2022-07-13 21:10:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:25,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:25,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:25,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:10:25,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:25,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2022-07-13 21:10:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:25,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586382866] [2022-07-13 21:10:25,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:25,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586382866] [2022-07-13 21:10:25,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586382866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:25,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:25,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390665463] [2022-07-13 21:10:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:25,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:25,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:25,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:25,214 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:25,810 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2022-07-13 21:10:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-13 21:10:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:25,832 INFO L225 Difference]: With dead ends: 2232 [2022-07-13 21:10:25,833 INFO L226 Difference]: Without dead ends: 1965 [2022-07-13 21:10:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 21:10:25,835 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 212 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1279 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-07-13 21:10:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2022-07-13 21:10:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-07-13 21:10:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2022-07-13 21:10:25,937 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2022-07-13 21:10:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:25,937 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2022-07-13 21:10:25,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2022-07-13 21:10:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:25,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:25,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:25,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:10:25,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2022-07-13 21:10:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:25,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60981869] [2022-07-13 21:10:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:26,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60981869] [2022-07-13 21:10:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60981869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:26,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:26,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191905407] [2022-07-13 21:10:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:26,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:26,085 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:10:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:27,645 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2022-07-13 21:10:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 21:10:27,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-07-13 21:10:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:27,664 INFO L225 Difference]: With dead ends: 3598 [2022-07-13 21:10:27,664 INFO L226 Difference]: Without dead ends: 3326 [2022-07-13 21:10:27,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 21:10:27,669 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1549 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:27,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 1321 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 21:10:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-07-13 21:10:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2022-07-13 21:10:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-07-13 21:10:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2022-07-13 21:10:27,862 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2022-07-13 21:10:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:27,864 INFO L495 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2022-07-13 21:10:27,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-13 21:10:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2022-07-13 21:10:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:27,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:27,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:27,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:10:27,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2022-07-13 21:10:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158673989] [2022-07-13 21:10:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:27,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158673989] [2022-07-13 21:10:27,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158673989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:27,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:27,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447934185] [2022-07-13 21:10:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:27,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:27,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:27,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:27,971 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:28,637 INFO L93 Difference]: Finished difference Result 4677 states and 6308 transitions. [2022-07-13 21:10:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:10:28,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-07-13 21:10:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:28,654 INFO L225 Difference]: With dead ends: 4677 [2022-07-13 21:10:28,654 INFO L226 Difference]: Without dead ends: 3265 [2022-07-13 21:10:28,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 21:10:28,658 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 210 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:28,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1277 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:10:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2022-07-13 21:10:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3121. [2022-07-13 21:10:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2476 states have (on average 1.3477382875605817) internal successors, (3337), 2536 states have internal predecessors, (3337), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2022-07-13 21:10:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4223 transitions. [2022-07-13 21:10:28,855 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4223 transitions. Word has length 65 [2022-07-13 21:10:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:28,856 INFO L495 AbstractCegarLoop]: Abstraction has 3121 states and 4223 transitions. [2022-07-13 21:10:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4223 transitions. [2022-07-13 21:10:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:28,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:28,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:28,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:10:28,858 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2022-07-13 21:10:28,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:28,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236874506] [2022-07-13 21:10:28,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236874506] [2022-07-13 21:10:28,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236874506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:28,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:28,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29967179] [2022-07-13 21:10:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:28,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:28,944 INFO L87 Difference]: Start difference. First operand 3121 states and 4223 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:29,695 INFO L93 Difference]: Finished difference Result 4556 states and 6062 transitions. [2022-07-13 21:10:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 21:10:29,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:29,711 INFO L225 Difference]: With dead ends: 4556 [2022-07-13 21:10:29,712 INFO L226 Difference]: Without dead ends: 3319 [2022-07-13 21:10:29,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:10:29,717 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 699 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:29,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 863 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 21:10:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-07-13 21:10:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3099. [2022-07-13 21:10:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2462 states have (on average 1.3456539398862712) internal successors, (3313), 2516 states have internal predecessors, (3313), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2022-07-13 21:10:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4183 transitions. [2022-07-13 21:10:29,921 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4183 transitions. Word has length 65 [2022-07-13 21:10:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:29,921 INFO L495 AbstractCegarLoop]: Abstraction has 3099 states and 4183 transitions. [2022-07-13 21:10:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4183 transitions. [2022-07-13 21:10:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 21:10:29,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:29,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:10:29,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2022-07-13 21:10:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114010971] [2022-07-13 21:10:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:29,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:30,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114010971] [2022-07-13 21:10:30,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114010971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:30,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:30,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764227926] [2022-07-13 21:10:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:30,004 INFO L87 Difference]: Start difference. First operand 3099 states and 4183 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:30,507 INFO L93 Difference]: Finished difference Result 6174 states and 8162 transitions. [2022-07-13 21:10:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:10:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-13 21:10:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:30,533 INFO L225 Difference]: With dead ends: 6174 [2022-07-13 21:10:30,534 INFO L226 Difference]: Without dead ends: 4742 [2022-07-13 21:10:30,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-13 21:10:30,538 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 810 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:30,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 575 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2022-07-13 21:10:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4470. [2022-07-13 21:10:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3528 states have (on average 1.312358276643991) internal successors, (4630), 3603 states have internal predecessors, (4630), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2022-07-13 21:10:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5924 transitions. [2022-07-13 21:10:30,828 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5924 transitions. Word has length 65 [2022-07-13 21:10:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:30,829 INFO L495 AbstractCegarLoop]: Abstraction has 4470 states and 5924 transitions. [2022-07-13 21:10:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 21:10:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5924 transitions. [2022-07-13 21:10:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 21:10:30,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:30,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:30,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:10:30,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2022-07-13 21:10:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:30,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295408425] [2022-07-13 21:10:30,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:30,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295408425] [2022-07-13 21:10:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295408425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:30,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492940452] [2022-07-13 21:10:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:30,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:30,899 INFO L87 Difference]: Start difference. First operand 4470 states and 5924 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:31,514 INFO L93 Difference]: Finished difference Result 9488 states and 12438 transitions. [2022-07-13 21:10:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:10:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-07-13 21:10:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:31,545 INFO L225 Difference]: With dead ends: 9488 [2022-07-13 21:10:31,545 INFO L226 Difference]: Without dead ends: 6664 [2022-07-13 21:10:31,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 21:10:31,556 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 381 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:31,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 817 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2022-07-13 21:10:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6148. [2022-07-13 21:10:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 4813 states have (on average 1.2944109702888011) internal successors, (6230), 4895 states have internal predecessors, (6230), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2022-07-13 21:10:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8039 transitions. [2022-07-13 21:10:31,935 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8039 transitions. Word has length 66 [2022-07-13 21:10:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:31,936 INFO L495 AbstractCegarLoop]: Abstraction has 6148 states and 8039 transitions. [2022-07-13 21:10:31,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 21:10:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8039 transitions. [2022-07-13 21:10:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 21:10:31,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:31,939 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 21:10:31,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:10:31,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2022-07-13 21:10:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496537740] [2022-07-13 21:10:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:31,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496537740] [2022-07-13 21:10:31,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496537740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:31,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:31,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:10:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805264502] [2022-07-13 21:10:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:31,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:10:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:10:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:31,997 INFO L87 Difference]: Start difference. First operand 6148 states and 8039 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:32,642 INFO L93 Difference]: Finished difference Result 7778 states and 10041 transitions. [2022-07-13 21:10:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 21:10:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-07-13 21:10:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:32,677 INFO L225 Difference]: With dead ends: 7778 [2022-07-13 21:10:32,677 INFO L226 Difference]: Without dead ends: 7775 [2022-07-13 21:10:32,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-13 21:10:32,682 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 946 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:32,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 585 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-07-13 21:10:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7202. [2022-07-13 21:10:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5616 states have (on average 1.2820512820512822) internal successors, (7200), 5707 states have internal predecessors, (7200), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2022-07-13 21:10:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9328 transitions. [2022-07-13 21:10:33,154 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9328 transitions. Word has length 73 [2022-07-13 21:10:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:33,154 INFO L495 AbstractCegarLoop]: Abstraction has 7202 states and 9328 transitions. [2022-07-13 21:10:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9328 transitions. [2022-07-13 21:10:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 21:10:33,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:33,157 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 21:10:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:10:33,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2022-07-13 21:10:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60947230] [2022-07-13 21:10:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60947230] [2022-07-13 21:10:33,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60947230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:33,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028408368] [2022-07-13 21:10:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:33,259 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) [2022-07-13 21:10:33,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 21:10:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 21:10:33,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:33,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:10:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:33,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028408368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:10:33,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:10:33,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-13 21:10:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840277717] [2022-07-13 21:10:33,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:10:33,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:10:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:10:33,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:33,856 INFO L87 Difference]: Start difference. First operand 7202 states and 9328 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 21:10:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:35,969 INFO L93 Difference]: Finished difference Result 14848 states and 18856 transitions. [2022-07-13 21:10:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 21:10:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-07-13 21:10:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:36,024 INFO L225 Difference]: With dead ends: 14848 [2022-07-13 21:10:36,024 INFO L226 Difference]: Without dead ends: 14845 [2022-07-13 21:10:36,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-07-13 21:10:36,035 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 1129 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:36,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1616 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 21:10:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14845 states. [2022-07-13 21:10:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14845 to 12460. [2022-07-13 21:10:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12460 states, 9708 states have (on average 1.2679233621755253) internal successors, (12309), 9851 states have internal predecessors, (12309), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2022-07-13 21:10:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 15942 transitions. [2022-07-13 21:10:36,877 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 15942 transitions. Word has length 74 [2022-07-13 21:10:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:36,878 INFO L495 AbstractCegarLoop]: Abstraction has 12460 states and 15942 transitions. [2022-07-13 21:10:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-13 21:10:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 15942 transitions. [2022-07-13 21:10:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-13 21:10:36,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:36,883 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 21:10:36,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:37,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 21:10:37,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2022-07-13 21:10:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732109933] [2022-07-13 21:10:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:10:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:37,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732109933] [2022-07-13 21:10:37,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732109933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:37,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:37,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578989484] [2022-07-13 21:10:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:37,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:37,152 INFO L87 Difference]: Start difference. First operand 12460 states and 15942 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:37,958 INFO L93 Difference]: Finished difference Result 19003 states and 24284 transitions. [2022-07-13 21:10:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:10:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-07-13 21:10:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:37,994 INFO L225 Difference]: With dead ends: 19003 [2022-07-13 21:10:37,995 INFO L226 Difference]: Without dead ends: 9065 [2022-07-13 21:10:38,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:38,023 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 440 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:38,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 823 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 21:10:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2022-07-13 21:10:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8513. [2022-07-13 21:10:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8513 states, 6655 states have (on average 1.2545454545454546) internal successors, (8349), 6754 states have internal predecessors, (8349), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2022-07-13 21:10:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8513 states to 8513 states and 10768 transitions. [2022-07-13 21:10:38,704 INFO L78 Accepts]: Start accepts. Automaton has 8513 states and 10768 transitions. Word has length 77 [2022-07-13 21:10:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:38,705 INFO L495 AbstractCegarLoop]: Abstraction has 8513 states and 10768 transitions. [2022-07-13 21:10:38,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-13 21:10:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8513 states and 10768 transitions. [2022-07-13 21:10:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 21:10:38,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:38,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:38,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:10:38,712 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2022-07-13 21:10:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132261612] [2022-07-13 21:10:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 21:10:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:10:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:38,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132261612] [2022-07-13 21:10:38,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132261612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:38,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:38,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 21:10:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632788498] [2022-07-13 21:10:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:38,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 21:10:38,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:38,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 21:10:38,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:38,809 INFO L87 Difference]: Start difference. First operand 8513 states and 10768 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:40,383 INFO L93 Difference]: Finished difference Result 22387 states and 27985 transitions. [2022-07-13 21:10:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 21:10:40,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-07-13 21:10:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:40,466 INFO L225 Difference]: With dead ends: 22387 [2022-07-13 21:10:40,466 INFO L226 Difference]: Without dead ends: 15544 [2022-07-13 21:10:40,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-07-13 21:10:40,495 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 765 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:40,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 962 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 21:10:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2022-07-13 21:10:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 14685. [2022-07-13 21:10:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 11331 states have (on average 1.2210749271908923) internal successors, (13836), 11536 states have internal predecessors, (13836), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2022-07-13 21:10:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 18374 transitions. [2022-07-13 21:10:41,349 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 18374 transitions. Word has length 84 [2022-07-13 21:10:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:41,350 INFO L495 AbstractCegarLoop]: Abstraction has 14685 states and 18374 transitions. [2022-07-13 21:10:41,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 18374 transitions. [2022-07-13 21:10:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 21:10:41,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:41,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 21:10:41,359 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2022-07-13 21:10:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:41,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109581142] [2022-07-13 21:10:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:10:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 21:10:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 21:10:41,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109581142] [2022-07-13 21:10:41,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109581142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32471803] [2022-07-13 21:10:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:41,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:41,435 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) [2022-07-13 21:10:41,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 21:10:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:41,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:41,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:10:41,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:41,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32471803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:41,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:41,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432641269] [2022-07-13 21:10:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:41,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:41,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:41,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:41,542 INFO L87 Difference]: Start difference. First operand 14685 states and 18374 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:42,323 INFO L93 Difference]: Finished difference Result 17754 states and 22695 transitions. [2022-07-13 21:10:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-07-13 21:10:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:42,384 INFO L225 Difference]: With dead ends: 17754 [2022-07-13 21:10:42,384 INFO L226 Difference]: Without dead ends: 15078 [2022-07-13 21:10:42,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:42,401 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 676 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 [2022-07-13 21:10:42,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 676 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2022-07-13 21:10:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 15078. [2022-07-13 21:10:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 11650 states have (on average 1.2243776824034336) internal successors, (14264), 11859 states have internal predecessors, (14264), 1712 states have call successors, (1712), 1402 states have call predecessors, (1712), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2022-07-13 21:10:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 18908 transitions. [2022-07-13 21:10:43,352 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 18908 transitions. Word has length 93 [2022-07-13 21:10:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:43,353 INFO L495 AbstractCegarLoop]: Abstraction has 15078 states and 18908 transitions. [2022-07-13 21:10:43,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 18908 transitions. [2022-07-13 21:10:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 21:10:43,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:43,362 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 21:10:43,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 21:10:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 21:10:43,587 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2022-07-13 21:10:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:43,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046961102] [2022-07-13 21:10:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:10:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:10:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:10:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:10:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:10:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:10:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 21:10:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 21:10:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046961102] [2022-07-13 21:10:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046961102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:43,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:43,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 21:10:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461131913] [2022-07-13 21:10:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:43,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 21:10:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 21:10:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:43,669 INFO L87 Difference]: Start difference. First operand 15078 states and 18908 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:45,446 INFO L93 Difference]: Finished difference Result 25952 states and 32227 transitions. [2022-07-13 21:10:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 21:10:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-13 21:10:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:45,528 INFO L225 Difference]: With dead ends: 25952 [2022-07-13 21:10:45,528 INFO L226 Difference]: Without dead ends: 13553 [2022-07-13 21:10:45,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-07-13 21:10:45,570 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 1129 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:45,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1138 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 21:10:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2022-07-13 21:10:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 12653. [2022-07-13 21:10:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 9816 states have (on average 1.2199470252648736) internal successors, (11975), 9992 states have internal predecessors, (11975), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2022-07-13 21:10:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15652 transitions. [2022-07-13 21:10:46,435 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15652 transitions. Word has length 93 [2022-07-13 21:10:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:46,435 INFO L495 AbstractCegarLoop]: Abstraction has 12653 states and 15652 transitions. [2022-07-13 21:10:46,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 21:10:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15652 transitions. [2022-07-13 21:10:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 21:10:46,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:46,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:46,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 21:10:46,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2022-07-13 21:10:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:46,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233195873] [2022-07-13 21:10:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 21:10:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 21:10:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 21:10:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 21:10:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:46,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233195873] [2022-07-13 21:10:46,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233195873] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:46,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142299644] [2022-07-13 21:10:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:46,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:46,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:46,536 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) [2022-07-13 21:10:46,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 21:10:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:46,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:46,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 21:10:46,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:46,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142299644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:46,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:46,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-13 21:10:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136722960] [2022-07-13 21:10:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:46,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:46,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:46,734 INFO L87 Difference]: Start difference. First operand 12653 states and 15652 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:10:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:47,463 INFO L93 Difference]: Finished difference Result 15507 states and 19695 transitions. [2022-07-13 21:10:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-07-13 21:10:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:47,507 INFO L225 Difference]: With dead ends: 15507 [2022-07-13 21:10:47,508 INFO L226 Difference]: Without dead ends: 13862 [2022-07-13 21:10:47,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:47,529 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 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 [2022-07-13 21:10:47,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2022-07-13 21:10:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 13818. [2022-07-13 21:10:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13818 states, 10756 states have (on average 1.2332651543324655) internal successors, (13265), 10949 states have internal predecessors, (13265), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2022-07-13 21:10:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13818 states to 13818 states and 17250 transitions. [2022-07-13 21:10:48,356 INFO L78 Accepts]: Start accepts. Automaton has 13818 states and 17250 transitions. Word has length 119 [2022-07-13 21:10:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:48,357 INFO L495 AbstractCegarLoop]: Abstraction has 13818 states and 17250 transitions. [2022-07-13 21:10:48,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 21:10:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13818 states and 17250 transitions. [2022-07-13 21:10:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 21:10:48,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:48,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:48,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 21:10:48,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:48,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2022-07-13 21:10:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:48,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313673528] [2022-07-13 21:10:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:10:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:10:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:10:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:10:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:10:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313673528] [2022-07-13 21:10:48,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313673528] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423285229] [2022-07-13 21:10:48,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:48,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:48,680 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) [2022-07-13 21:10:48,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 21:10:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:48,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:10:48,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 21:10:48,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:48,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423285229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:48,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:48,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807619623] [2022-07-13 21:10:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:48,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:48,802 INFO L87 Difference]: Start difference. First operand 13818 states and 17250 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:10:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:49,376 INFO L93 Difference]: Finished difference Result 17504 states and 22428 transitions. [2022-07-13 21:10:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:49,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-07-13 21:10:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:49,415 INFO L225 Difference]: With dead ends: 17504 [2022-07-13 21:10:49,416 INFO L226 Difference]: Without dead ends: 14312 [2022-07-13 21:10:49,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:49,432 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 307 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 [2022-07-13 21:10:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2022-07-13 21:10:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 14202. [2022-07-13 21:10:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14202 states, 11115 states have (on average 1.2191632928475034) internal successors, (13551), 11303 states have internal predecessors, (13551), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-07-13 21:10:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14202 states to 14202 states and 17514 transitions. [2022-07-13 21:10:50,427 INFO L78 Accepts]: Start accepts. Automaton has 14202 states and 17514 transitions. Word has length 135 [2022-07-13 21:10:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:50,427 INFO L495 AbstractCegarLoop]: Abstraction has 14202 states and 17514 transitions. [2022-07-13 21:10:50,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 21:10:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 14202 states and 17514 transitions. [2022-07-13 21:10:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-13 21:10:50,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:50,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:50,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 21:10:50,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:50,660 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2022-07-13 21:10:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624247151] [2022-07-13 21:10:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 21:10:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 21:10:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 21:10:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 21:10:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 21:10:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624247151] [2022-07-13 21:10:50,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624247151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070302136] [2022-07-13 21:10:50,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:50,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:50,750 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) [2022-07-13 21:10:50,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 21:10:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:50,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:10:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 21:10:50,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:50,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070302136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:50,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:50,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123123212] [2022-07-13 21:10:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:50,857 INFO L87 Difference]: Start difference. First operand 14202 states and 17514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:10:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:51,569 INFO L93 Difference]: Finished difference Result 17861 states and 22355 transitions. [2022-07-13 21:10:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-07-13 21:10:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:51,604 INFO L225 Difference]: With dead ends: 17861 [2022-07-13 21:10:51,604 INFO L226 Difference]: Without dead ends: 14287 [2022-07-13 21:10:51,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:51,617 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 248 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 431 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 [2022-07-13 21:10:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2022-07-13 21:10:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 14172. [2022-07-13 21:10:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14172 states, 11085 states have (on average 1.211637347767253) internal successors, (13431), 11273 states have internal predecessors, (13431), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-07-13 21:10:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 17394 transitions. [2022-07-13 21:10:52,582 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 17394 transitions. Word has length 135 [2022-07-13 21:10:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:52,582 INFO L495 AbstractCegarLoop]: Abstraction has 14172 states and 17394 transitions. [2022-07-13 21:10:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 21:10:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 17394 transitions. [2022-07-13 21:10:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-13 21:10:52,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:52,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:52,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 21:10:52,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 21:10:52,793 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2022-07-13 21:10:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:52,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752843128] [2022-07-13 21:10:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 21:10:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 21:10:52,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:52,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752843128] [2022-07-13 21:10:52,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752843128] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:52,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472470766] [2022-07-13 21:10:52,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:52,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:52,879 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) [2022-07-13 21:10:52,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 21:10:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:52,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 21:10:52,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 21:10:53,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:53,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472470766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:53,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:53,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-13 21:10:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624495101] [2022-07-13 21:10:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:53,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:10:53,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:53,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:10:53,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:53,051 INFO L87 Difference]: Start difference. First operand 14172 states and 17394 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:10:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:53,821 INFO L93 Difference]: Finished difference Result 15677 states and 19438 transitions. [2022-07-13 21:10:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:10:53,822 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-07-13 21:10:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:53,864 INFO L225 Difference]: With dead ends: 15677 [2022-07-13 21:10:53,864 INFO L226 Difference]: Without dead ends: 13893 [2022-07-13 21:10:53,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 21:10:53,876 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 88 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 650 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 [2022-07-13 21:10:53,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 650 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2022-07-13 21:10:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 13829. [2022-07-13 21:10:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10810 states have (on average 1.2055504162812212) internal successors, (13032), 10994 states have internal predecessors, (13032), 1501 states have call successors, (1501), 1237 states have call predecessors, (1501), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2022-07-13 21:10:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16895 transitions. [2022-07-13 21:10:54,769 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16895 transitions. Word has length 136 [2022-07-13 21:10:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:54,769 INFO L495 AbstractCegarLoop]: Abstraction has 13829 states and 16895 transitions. [2022-07-13 21:10:54,769 INFO L496 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 21:10:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16895 transitions. [2022-07-13 21:10:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:10:54,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:54,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:54,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:54,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:54,981 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2022-07-13 21:10:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41306913] [2022-07-13 21:10:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:10:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41306913] [2022-07-13 21:10:55,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41306913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132944402] [2022-07-13 21:10:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:55,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:55,068 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) [2022-07-13 21:10:55,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 21:10:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:55,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 21:10:55,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 21:10:55,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132944402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-13 21:10:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281446047] [2022-07-13 21:10:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:55,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:10:55,234 INFO L87 Difference]: Start difference. First operand 13829 states and 16895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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) [2022-07-13 21:10:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:56,122 INFO L93 Difference]: Finished difference Result 15723 states and 19305 transitions. [2022-07-13 21:10:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:10:56,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-13 21:10:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:56,153 INFO L225 Difference]: With dead ends: 15723 [2022-07-13 21:10:56,153 INFO L226 Difference]: Without dead ends: 12689 [2022-07-13 21:10:56,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:10:56,163 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 339 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:10:56,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 523 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:10:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2022-07-13 21:10:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12501. [2022-07-13 21:10:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12501 states, 9730 states have (on average 1.18879753340185) internal successors, (11567), 9890 states have internal predecessors, (11567), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-07-13 21:10:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 15067 transitions. [2022-07-13 21:10:56,926 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 15067 transitions. Word has length 137 [2022-07-13 21:10:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:56,926 INFO L495 AbstractCegarLoop]: Abstraction has 12501 states and 15067 transitions. [2022-07-13 21:10:56,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 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) [2022-07-13 21:10:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 15067 transitions. [2022-07-13 21:10:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:10:56,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:56,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:56,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 21:10:57,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:57,136 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2022-07-13 21:10:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:57,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381502815] [2022-07-13 21:10:57,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:57,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 21:10:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:57,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381502815] [2022-07-13 21:10:57,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381502815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:10:57,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037374022] [2022-07-13 21:10:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:57,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:10:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:10:57,209 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) [2022-07-13 21:10:57,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 21:10:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:57,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 21:10:57,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:10:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 21:10:57,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:10:57,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037374022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:57,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:10:57,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 21:10:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401177024] [2022-07-13 21:10:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:57,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:10:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:10:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:10:57,326 INFO L87 Difference]: Start difference. First operand 12501 states and 15067 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:10:57,901 INFO L93 Difference]: Finished difference Result 14431 states and 17466 transitions. [2022-07-13 21:10:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:10:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-07-13 21:10:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:10:57,930 INFO L225 Difference]: With dead ends: 14431 [2022-07-13 21:10:57,930 INFO L226 Difference]: Without dead ends: 12557 [2022-07-13 21:10:57,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 21:10:57,939 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 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 [2022-07-13 21:10:57,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:10:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2022-07-13 21:10:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12525. [2022-07-13 21:10:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12525 states, 9754 states have (on average 1.1847447201148247) internal successors, (11556), 9914 states have internal predecessors, (11556), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-07-13 21:10:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12525 states to 12525 states and 15056 transitions. [2022-07-13 21:10:58,566 INFO L78 Accepts]: Start accepts. Automaton has 12525 states and 15056 transitions. Word has length 137 [2022-07-13 21:10:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:10:58,567 INFO L495 AbstractCegarLoop]: Abstraction has 12525 states and 15056 transitions. [2022-07-13 21:10:58,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:10:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12525 states and 15056 transitions. [2022-07-13 21:10:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 21:10:58,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:10:58,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:10:58,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 21:10:58,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-13 21:10:58,776 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:10:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:10:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2022-07-13 21:10:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:10:58,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469315914] [2022-07-13 21:10:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:10:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:10:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:10:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:10:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:10:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:10:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:10:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:10:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:10:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:10:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:10:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:10:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:10:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 21:10:58,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:10:58,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469315914] [2022-07-13 21:10:58,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469315914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:10:58,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:10:58,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:10:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988322251] [2022-07-13 21:10:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:10:58,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:10:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:10:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:10:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:10:58,845 INFO L87 Difference]: Start difference. First operand 12525 states and 15056 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:11:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:11:00,089 INFO L93 Difference]: Finished difference Result 13983 states and 16730 transitions. [2022-07-13 21:11:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:11:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-07-13 21:11:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:11:00,123 INFO L225 Difference]: With dead ends: 13983 [2022-07-13 21:11:00,123 INFO L226 Difference]: Without dead ends: 13980 [2022-07-13 21:11:00,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 21:11:00,132 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 718 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 21:11:00,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 817 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 21:11:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2022-07-13 21:11:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13496. [2022-07-13 21:11:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 10552 states have (on average 1.182524639878696) internal successors, (12478), 10722 states have internal predecessors, (12478), 1454 states have call successors, (1454), 1207 states have call predecessors, (1454), 1488 states have return successors, (2252), 1577 states have call predecessors, (2252), 1451 states have call successors, (2252) [2022-07-13 21:11:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 16184 transitions. [2022-07-13 21:11:00,947 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 16184 transitions. Word has length 137 [2022-07-13 21:11:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:11:00,947 INFO L495 AbstractCegarLoop]: Abstraction has 13496 states and 16184 transitions. [2022-07-13 21:11:00,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 21:11:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 16184 transitions. [2022-07-13 21:11:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 21:11:00,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:11:00,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:11:00,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 21:11:00,956 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:11:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:11:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2022-07-13 21:11:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:11:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762387140] [2022-07-13 21:11:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:11:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:11:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:11:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 21:11:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 21:11:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:11:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:11:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 21:11:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 21:11:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 21:11:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:11:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 21:11:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 21:11:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 21:11:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 21:11:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 21:11:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 21:11:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 21:11:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 21:11:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:11:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762387140] [2022-07-13 21:11:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762387140] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:11:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047484966] [2022-07-13 21:11:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:11:01,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:11:01,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:11:01,040 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) [2022-07-13 21:11:01,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 21:11:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:01,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 21:11:01,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:11:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 21:11:01,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:11:01,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047484966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:11:01,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:11:01,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-13 21:11:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436252193] [2022-07-13 21:11:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:11:01,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:11:01,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:11:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:11:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 21:11:01,172 INFO L87 Difference]: Start difference. First operand 13496 states and 16184 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:11:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:11:01,640 INFO L93 Difference]: Finished difference Result 18644 states and 22404 transitions. [2022-07-13 21:11:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:11:01,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-07-13 21:11:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:11:01,659 INFO L225 Difference]: With dead ends: 18644 [2022-07-13 21:11:01,660 INFO L226 Difference]: Without dead ends: 8062 [2022-07-13 21:11:01,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 21:11:01,674 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 21:11:01,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 21:11:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-13 21:11:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7620. [2022-07-13 21:11:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 6117 states have (on average 1.1678927578878535) internal successors, (7144), 6185 states have internal predecessors, (7144), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-07-13 21:11:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 8992 transitions. [2022-07-13 21:11:02,160 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 8992 transitions. Word has length 145 [2022-07-13 21:11:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:11:02,161 INFO L495 AbstractCegarLoop]: Abstraction has 7620 states and 8992 transitions. [2022-07-13 21:11:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 21:11:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 8992 transitions. [2022-07-13 21:11:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 21:11:02,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:11:02,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:11:02,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 21:11:02,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 21:11:02,369 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:11:02,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:11:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2022-07-13 21:11:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:11:02,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909151172] [2022-07-13 21:11:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:11:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:11:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 21:11:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 21:11:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 21:11:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 21:11:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 21:11:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 21:11:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 21:11:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:11:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 21:11:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 21:11:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 21:11:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:11:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 21:11:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:11:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909151172] [2022-07-13 21:11:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909151172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:11:02,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:11:02,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:11:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039186000] [2022-07-13 21:11:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:11:02,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:11:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:11:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:11:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:11:02,437 INFO L87 Difference]: Start difference. First operand 7620 states and 8992 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:11:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 21:11:03,103 INFO L93 Difference]: Finished difference Result 10269 states and 12313 transitions. [2022-07-13 21:11:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 21:11:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-07-13 21:11:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 21:11:03,128 INFO L225 Difference]: With dead ends: 10269 [2022-07-13 21:11:03,128 INFO L226 Difference]: Without dead ends: 8441 [2022-07-13 21:11:03,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:11:03,134 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 247 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 21:11:03,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 775 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 21:11:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2022-07-13 21:11:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 7623. [2022-07-13 21:11:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 6120 states have (on average 1.16781045751634) internal successors, (7147), 6188 states have internal predecessors, (7147), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-07-13 21:11:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 8995 transitions. [2022-07-13 21:11:03,586 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 8995 transitions. Word has length 141 [2022-07-13 21:11:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 21:11:03,586 INFO L495 AbstractCegarLoop]: Abstraction has 7623 states and 8995 transitions. [2022-07-13 21:11:03,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 21:11:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 8995 transitions. [2022-07-13 21:11:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 21:11:03,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 21:11:03,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:11:03,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 21:11:03,593 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 21:11:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:11:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2022-07-13 21:11:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:11:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173417698] [2022-07-13 21:11:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:11:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:11:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:11:03,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:11:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:11:03,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:11:03,688 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:11:03,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-13 21:11:03,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-13 21:11:03,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 21:11:03,695 INFO L356 BasicCegarLoop]: Path program histogram: [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] [2022-07-13 21:11:03,700 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:11:03,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:11:03 BoogieIcfgContainer [2022-07-13 21:11:03,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:11:03,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:11:03,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:11:03,852 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:11:03,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:10:17" (3/4) ... [2022-07-13 21:11:03,854 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:11:03,968 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:11:03,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:11:03,969 INFO L158 Benchmark]: Toolchain (without parser) took 47120.36ms. Allocated memory was 77.6MB in the beginning and 4.4GB in the end (delta: 4.4GB). Free memory was 41.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-07-13 21:11:03,969 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:11:03,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.43ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 41.1MB in the beginning and 69.7MB in the end (delta: -28.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-13 21:11:03,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.17ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 66.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:11:03,970 INFO L158 Benchmark]: Boogie Preprocessor took 45.25ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:11:03,971 INFO L158 Benchmark]: RCFGBuilder took 661.38ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 63.6MB in the end (delta: 1.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-13 21:11:03,972 INFO L158 Benchmark]: TraceAbstraction took 45908.55ms. Allocated memory was 98.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 63.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-07-13 21:11:03,972 INFO L158 Benchmark]: Witness Printer took 116.27ms. Allocated memory is still 4.4GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 21:11:03,980 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory was 57.9MB in the beginning and 57.8MB in the end (delta: 75.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.43ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 41.1MB in the beginning and 69.7MB in the end (delta: -28.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.17ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 66.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.25ms. Allocated memory is still 98.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 661.38ms. Allocated memory is still 98.6MB. Free memory was 64.7MB in the beginning and 63.6MB in the end (delta: 1.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45908.55ms. Allocated memory was 98.6MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 63.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 116.27ms. Allocated memory is still 4.4GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. 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: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: 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 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15067 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14690 mSDsluCounter, 25028 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15933 mSDsCounter, 3697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13515 IncrementalHoareTripleChecker+Invalid, 17212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3697 mSolverCounterUnsat, 9095 mSDtfsCounter, 13515 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1756 SyntacticMatches, 5 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15078occurred in iteration=18, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 9769 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7289 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:11:04,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE