./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:04:35,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:04:35,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:04:35,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:04:35,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:04:35,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:04:35,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:04:35,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:04:35,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:04:35,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:04:35,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:04:35,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:04:35,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:04:35,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:04:35,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:04:35,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:04:35,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:04:35,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:04:35,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:04:35,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:04:35,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:04:35,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:04:35,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:04:35,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:04:35,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:04:35,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:04:35,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:04:35,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:04:35,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:04:35,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:04:35,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:04:35,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:04:35,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:04:35,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:04:35,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:04:35,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:04:35,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:04:35,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:04:35,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:04:35,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:04:35,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:04:35,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:04:35,428 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:04:35,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:04:35,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:04:35,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:04:35,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:04:35,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:04:35,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:04:35,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:04:35,429 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:04:35,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:04:35,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:04:35,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:04:35,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:04:35,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:04:35,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:04:35,432 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 -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2021-12-17 21:04:35,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:04:35,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:04:35,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:04:35,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:04:35,698 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:04:35,700 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.02.cil-2.c [2021-12-17 21:04:35,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1df62af/7ce876616983456faecacb9180ac9ed6/FLAGbaa713dc5 [2021-12-17 21:04:36,158 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:04:36,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2021-12-17 21:04:36,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1df62af/7ce876616983456faecacb9180ac9ed6/FLAGbaa713dc5 [2021-12-17 21:04:36,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1df62af/7ce876616983456faecacb9180ac9ed6 [2021-12-17 21:04:36,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:04:36,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:04:36,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:04:36,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:04:36,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:04:36,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f6ea7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36, skipping insertion in model container [2021-12-17 21:04:36,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:04:36,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:04:36,329 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.02.cil-2.c[914,927] [2021-12-17 21:04:36,376 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.02.cil-2.c[7115,7128] [2021-12-17 21:04:36,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:04:36,410 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:04:36,418 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.02.cil-2.c[914,927] [2021-12-17 21:04:36,445 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.02.cil-2.c[7115,7128] [2021-12-17 21:04:36,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:04:36,481 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:04:36,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36 WrapperNode [2021-12-17 21:04:36,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:04:36,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:04:36,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:04:36,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:04:36,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,516 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2021-12-17 21:04:36,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:04:36,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:04:36,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:04:36,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:04:36,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:04:36,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:04:36,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:04:36,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:04:36,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (1/1) ... [2021-12-17 21:04:36,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:04:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:36,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 21:04:36,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 21:04:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:04:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 21:04:36,676 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 21:04:36,676 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-17 21:04:36,677 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-17 21:04:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-17 21:04:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-17 21:04:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-17 21:04:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-17 21:04:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-17 21:04:36,678 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-17 21:04:36,678 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-17 21:04:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-17 21:04:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-17 21:04:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-17 21:04:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-17 21:04:36,679 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-17 21:04:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-17 21:04:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-17 21:04:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-17 21:04:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-17 21:04:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-17 21:04:36,680 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-17 21:04:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:04:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-17 21:04:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-17 21:04:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-17 21:04:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-17 21:04:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:04:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:04:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-17 21:04:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-17 21:04:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-17 21:04:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-17 21:04:36,749 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:04:36,751 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:04:37,164 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:04:37,173 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:04:37,177 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-17 21:04:37,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:37 BoogieIcfgContainer [2021-12-17 21:04:37,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:04:37,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:04:37,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:04:37,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:04:37,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:04:36" (1/3) ... [2021-12-17 21:04:37,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c3b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:37, skipping insertion in model container [2021-12-17 21:04:37,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:04:36" (2/3) ... [2021-12-17 21:04:37,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464c3b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:04:37, skipping insertion in model container [2021-12-17 21:04:37,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:37" (3/3) ... [2021-12-17 21:04:37,186 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2021-12-17 21:04:37,189 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:04:37,190 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 21:04:37,241 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:04:37,247 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 21:04:37,247 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 21:04:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-17 21:04:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:37,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:37,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:37,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:37,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2021-12-17 21:04:37,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681980763] [2021-12-17 21:04:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:37,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:37,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681980763] [2021-12-17 21:04:37,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681980763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:37,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:37,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:37,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093163586] [2021-12-17 21:04:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:37,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:37,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:37,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:37,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:37,537 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:37,927 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2021-12-17 21:04:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 21:04:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-17 21:04:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:37,938 INFO L225 Difference]: With dead ends: 482 [2021-12-17 21:04:37,938 INFO L226 Difference]: Without dead ends: 248 [2021-12-17 21:04:37,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:37,943 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 351 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:37,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 923 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-17 21:04:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2021-12-17 21:04:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-17 21:04:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2021-12-17 21:04:37,984 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2021-12-17 21:04:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:37,984 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2021-12-17 21:04:37,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-17 21:04:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2021-12-17 21:04:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:37,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:37,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:37,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:04:37,988 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2021-12-17 21:04:37,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:37,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802597644] [2021-12-17 21:04:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:37,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:38,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:38,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802597644] [2021-12-17 21:04:38,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802597644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:38,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:38,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:38,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400196794] [2021-12-17 21:04:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:38,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:38,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:38,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:38,105 INFO L87 Difference]: Start difference. First operand 230 states and 328 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) [2021-12-17 21:04:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:38,624 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2021-12-17 21:04:38,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 21:04:38,625 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 [2021-12-17 21:04:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:38,627 INFO L225 Difference]: With dead ends: 453 [2021-12-17 21:04:38,628 INFO L226 Difference]: Without dead ends: 365 [2021-12-17 21:04:38,628 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:38,629 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 592 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:38,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 1008 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-17 21:04:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2021-12-17 21:04:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2021-12-17 21:04:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2021-12-17 21:04:38,652 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2021-12-17 21:04:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:38,653 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2021-12-17 21:04:38,653 INFO L471 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) [2021-12-17 21:04:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2021-12-17 21:04:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:38,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:38,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:38,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:04:38,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2021-12-17 21:04:38,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:38,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643674216] [2021-12-17 21:04:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:38,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:38,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643674216] [2021-12-17 21:04:38,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643674216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:38,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:38,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:38,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177113910] [2021-12-17 21:04:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:38,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:38,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:38,811 INFO L87 Difference]: Start difference. First operand 326 states and 459 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) [2021-12-17 21:04:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:39,357 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2021-12-17 21:04:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:39,358 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 [2021-12-17 21:04:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:39,360 INFO L225 Difference]: With dead ends: 540 [2021-12-17 21:04:39,360 INFO L226 Difference]: Without dead ends: 363 [2021-12-17 21:04:39,361 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:39,362 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 252 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:39,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1595 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-17 21:04:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2021-12-17 21:04:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2021-12-17 21:04:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2021-12-17 21:04:39,381 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2021-12-17 21:04:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:39,381 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2021-12-17 21:04:39,382 INFO L471 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) [2021-12-17 21:04:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2021-12-17 21:04:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:39,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:39,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:39,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 21:04:39,384 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2021-12-17 21:04:39,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:39,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773634480] [2021-12-17 21:04:39,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:39,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:39,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773634480] [2021-12-17 21:04:39,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773634480] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:39,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:39,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 21:04:39,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712947427] [2021-12-17 21:04:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:39,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:04:39,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:39,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:04:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:04:39,472 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 21:04:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:40,711 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2021-12-17 21:04:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 21:04:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-12-17 21:04:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:40,716 INFO L225 Difference]: With dead ends: 1231 [2021-12-17 21:04:40,717 INFO L226 Difference]: Without dead ends: 1037 [2021-12-17 21:04:40,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-17 21:04:40,724 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 1873 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:40,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1889 Valid, 1727 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:04:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-12-17 21:04:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2021-12-17 21:04:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2021-12-17 21:04:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2021-12-17 21:04:40,788 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2021-12-17 21:04:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:40,788 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2021-12-17 21:04:40,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-17 21:04:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2021-12-17 21:04:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:40,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:40,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:40,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 21:04:40,792 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2021-12-17 21:04:40,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375742199] [2021-12-17 21:04:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:40,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:40,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:40,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375742199] [2021-12-17 21:04:40,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375742199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:40,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:40,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:40,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448729484] [2021-12-17 21:04:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:40,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:40,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:40,927 INFO L87 Difference]: Start difference. First operand 912 states and 1204 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) [2021-12-17 21:04:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:41,338 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2021-12-17 21:04:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:04:41,339 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 [2021-12-17 21:04:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:41,343 INFO L225 Difference]: With dead ends: 1793 [2021-12-17 21:04:41,344 INFO L226 Difference]: Without dead ends: 1024 [2021-12-17 21:04:41,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:04:41,349 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 372 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:41,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 1429 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-12-17 21:04:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2021-12-17 21:04:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2021-12-17 21:04:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2021-12-17 21:04:41,424 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2021-12-17 21:04:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:41,425 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2021-12-17 21:04:41,425 INFO L471 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) [2021-12-17 21:04:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2021-12-17 21:04:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:41,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:41,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:41,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 21:04:41,427 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2021-12-17 21:04:41,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:41,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020512797] [2021-12-17 21:04:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:41,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:41,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:41,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020512797] [2021-12-17 21:04:41,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020512797] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:41,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:41,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:41,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278325682] [2021-12-17 21:04:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:41,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:41,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:41,522 INFO L87 Difference]: Start difference. First operand 932 states and 1219 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) [2021-12-17 21:04:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:42,136 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2021-12-17 21:04:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 21:04:42,137 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 [2021-12-17 21:04:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:42,144 INFO L225 Difference]: With dead ends: 2500 [2021-12-17 21:04:42,144 INFO L226 Difference]: Without dead ends: 1712 [2021-12-17 21:04:42,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-17 21:04:42,146 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 650 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:42,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 1173 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2021-12-17 21:04:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2021-12-17 21:04:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2021-12-17 21:04:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2021-12-17 21:04:42,205 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2021-12-17 21:04:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:42,205 INFO L470 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2021-12-17 21:04:42,205 INFO L471 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) [2021-12-17 21:04:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2021-12-17 21:04:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 21:04:42,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:42,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:42,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 21:04:42,207 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2021-12-17 21:04:42,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:42,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235132658] [2021-12-17 21:04:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:42,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:42,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235132658] [2021-12-17 21:04:42,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235132658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:42,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:42,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:42,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146956811] [2021-12-17 21:04:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:42,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:42,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:42,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:42,285 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 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) [2021-12-17 21:04:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:42,660 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2021-12-17 21:04:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 21:04:42,660 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 [2021-12-17 21:04:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:42,672 INFO L225 Difference]: With dead ends: 3851 [2021-12-17 21:04:42,672 INFO L226 Difference]: Without dead ends: 2617 [2021-12-17 21:04:42,675 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:42,676 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 772 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:42,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 780 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2021-12-17 21:04:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2021-12-17 21:04:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2021-12-17 21:04:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2021-12-17 21:04:42,782 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2021-12-17 21:04:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:42,783 INFO L470 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2021-12-17 21:04:42,783 INFO L471 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) [2021-12-17 21:04:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2021-12-17 21:04:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-17 21:04:42,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:42,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:42,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 21:04:42,785 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2021-12-17 21:04:42,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:42,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952357424] [2021-12-17 21:04:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:42,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:42,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:42,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952357424] [2021-12-17 21:04:42,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952357424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:42,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:42,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:42,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740965358] [2021-12-17 21:04:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:42,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:42,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:42,874 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 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) [2021-12-17 21:04:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:43,256 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2021-12-17 21:04:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:43,257 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 [2021-12-17 21:04:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:43,276 INFO L225 Difference]: With dead ends: 5831 [2021-12-17 21:04:43,276 INFO L226 Difference]: Without dead ends: 3468 [2021-12-17 21:04:43,282 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:43,283 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 421 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:43,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 931 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-12-17 21:04:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2021-12-17 21:04:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2021-12-17 21:04:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2021-12-17 21:04:43,427 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2021-12-17 21:04:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:43,427 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2021-12-17 21:04:43,427 INFO L471 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) [2021-12-17 21:04:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2021-12-17 21:04:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:43,428 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:43,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:43,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 21:04:43,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2021-12-17 21:04:43,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:43,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770737660] [2021-12-17 21:04:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:43,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:43,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770737660] [2021-12-17 21:04:43,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770737660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:43,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:43,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:04:43,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578040444] [2021-12-17 21:04:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:43,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:04:43,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:04:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:04:43,474 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:43,904 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2021-12-17 21:04:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:43,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:43,920 INFO L225 Difference]: With dead ends: 3374 [2021-12-17 21:04:43,920 INFO L226 Difference]: Without dead ends: 3246 [2021-12-17 21:04:43,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:43,924 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 396 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:43,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 680 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2021-12-17 21:04:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2021-12-17 21:04:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2021-12-17 21:04:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2021-12-17 21:04:44,123 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2021-12-17 21:04:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:44,124 INFO L470 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2021-12-17 21:04:44,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2021-12-17 21:04:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:44,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:44,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:44,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 21:04:44,126 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2021-12-17 21:04:44,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:44,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419668162] [2021-12-17 21:04:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:44,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:44,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419668162] [2021-12-17 21:04:44,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419668162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:44,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:44,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:44,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095196692] [2021-12-17 21:04:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:44,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:44,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:44,193 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:44,943 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2021-12-17 21:04:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:44,953 INFO L225 Difference]: With dead ends: 3524 [2021-12-17 21:04:44,954 INFO L226 Difference]: Without dead ends: 3400 [2021-12-17 21:04:44,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:44,955 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 637 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:44,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 885 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:04:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2021-12-17 21:04:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2021-12-17 21:04:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2021-12-17 21:04:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2021-12-17 21:04:45,095 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2021-12-17 21:04:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:45,096 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2021-12-17 21:04:45,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2021-12-17 21:04:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:45,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:45,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:45,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 21:04:45,098 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:45,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2021-12-17 21:04:45,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:45,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160924424] [2021-12-17 21:04:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:45,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:45,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:45,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160924424] [2021-12-17 21:04:45,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160924424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:45,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:45,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:45,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197639648] [2021-12-17 21:04:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:45,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:45,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:45,154 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:45,584 INFO L93 Difference]: Finished difference Result 3645 states and 4670 transitions. [2021-12-17 21:04:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:45,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:45,595 INFO L225 Difference]: With dead ends: 3645 [2021-12-17 21:04:45,595 INFO L226 Difference]: Without dead ends: 3400 [2021-12-17 21:04:45,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:45,597 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 631 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:45,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 720 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2021-12-17 21:04:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2021-12-17 21:04:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2739097169089517) internal successors, (3330), 2666 states have internal predecessors, (3330), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2021-12-17 21:04:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4195 transitions. [2021-12-17 21:04:45,719 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4195 transitions. Word has length 69 [2021-12-17 21:04:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:45,720 INFO L470 AbstractCegarLoop]: Abstraction has 3335 states and 4195 transitions. [2021-12-17 21:04:45,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4195 transitions. [2021-12-17 21:04:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:45,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:45,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:45,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 21:04:45,721 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:45,722 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2021-12-17 21:04:45,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:45,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944149273] [2021-12-17 21:04:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:45,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:45,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944149273] [2021-12-17 21:04:45,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944149273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:45,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:45,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:45,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485673462] [2021-12-17 21:04:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:45,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:45,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:45,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:45,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:45,767 INFO L87 Difference]: Start difference. First operand 3335 states and 4195 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:46,569 INFO L93 Difference]: Finished difference Result 3831 states and 4935 transitions. [2021-12-17 21:04:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 21:04:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:46,583 INFO L225 Difference]: With dead ends: 3831 [2021-12-17 21:04:46,583 INFO L226 Difference]: Without dead ends: 3586 [2021-12-17 21:04:46,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:04:46,586 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 670 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:46,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 1104 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:04:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2021-12-17 21:04:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3447. [2021-12-17 21:04:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2709 states have (on average 1.2812846068660022) internal successors, (3471), 2762 states have internal predecessors, (3471), 367 states have call successors, (367), 298 states have call predecessors, (367), 369 states have return successors, (520), 390 states have call predecessors, (520), 363 states have call successors, (520) [2021-12-17 21:04:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4358 transitions. [2021-12-17 21:04:46,776 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4358 transitions. Word has length 69 [2021-12-17 21:04:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:46,777 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4358 transitions. [2021-12-17 21:04:46,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4358 transitions. [2021-12-17 21:04:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:46,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:46,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:46,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 21:04:46,780 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2021-12-17 21:04:46,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023112855] [2021-12-17 21:04:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:46,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:46,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:46,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023112855] [2021-12-17 21:04:46,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023112855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:46,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:46,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:46,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339004005] [2021-12-17 21:04:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:46,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:46,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:46,845 INFO L87 Difference]: Start difference. First operand 3447 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:47,266 INFO L93 Difference]: Finished difference Result 3898 states and 5035 transitions. [2021-12-17 21:04:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:47,278 INFO L225 Difference]: With dead ends: 3898 [2021-12-17 21:04:47,278 INFO L226 Difference]: Without dead ends: 3541 [2021-12-17 21:04:47,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:47,280 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 625 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:47,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 707 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2021-12-17 21:04:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3447. [2021-12-17 21:04:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2709 states have (on average 1.2801771871539314) internal successors, (3468), 2762 states have internal predecessors, (3468), 367 states have call successors, (367), 298 states have call predecessors, (367), 369 states have return successors, (520), 390 states have call predecessors, (520), 363 states have call successors, (520) [2021-12-17 21:04:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4355 transitions. [2021-12-17 21:04:47,411 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4355 transitions. Word has length 69 [2021-12-17 21:04:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:47,411 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4355 transitions. [2021-12-17 21:04:47,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4355 transitions. [2021-12-17 21:04:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:47,413 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:47,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:47,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 21:04:47,413 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2021-12-17 21:04:47,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346481046] [2021-12-17 21:04:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:47,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:47,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346481046] [2021-12-17 21:04:47,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346481046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:47,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:47,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:47,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967301038] [2021-12-17 21:04:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:47,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:47,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:47,471 INFO L87 Difference]: Start difference. First operand 3447 states and 4355 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:47,918 INFO L93 Difference]: Finished difference Result 3894 states and 5018 transitions. [2021-12-17 21:04:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:47,936 INFO L225 Difference]: With dead ends: 3894 [2021-12-17 21:04:47,936 INFO L226 Difference]: Without dead ends: 3537 [2021-12-17 21:04:47,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:04:47,939 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 623 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:47,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 704 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:04:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2021-12-17 21:04:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3447. [2021-12-17 21:04:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2709 states have (on average 1.2790697674418605) internal successors, (3465), 2762 states have internal predecessors, (3465), 367 states have call successors, (367), 298 states have call predecessors, (367), 369 states have return successors, (520), 390 states have call predecessors, (520), 363 states have call successors, (520) [2021-12-17 21:04:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4352 transitions. [2021-12-17 21:04:48,061 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4352 transitions. Word has length 69 [2021-12-17 21:04:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:48,061 INFO L470 AbstractCegarLoop]: Abstraction has 3447 states and 4352 transitions. [2021-12-17 21:04:48,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4352 transitions. [2021-12-17 21:04:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:48,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:48,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:48,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 21:04:48,065 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2021-12-17 21:04:48,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:48,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627347753] [2021-12-17 21:04:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:48,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:48,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:48,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627347753] [2021-12-17 21:04:48,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627347753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:48,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:48,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:48,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240378667] [2021-12-17 21:04:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:48,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:48,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:48,146 INFO L87 Difference]: Start difference. First operand 3447 states and 4352 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:48,769 INFO L93 Difference]: Finished difference Result 3996 states and 5172 transitions. [2021-12-17 21:04:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:48,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:48,790 INFO L225 Difference]: With dead ends: 3996 [2021-12-17 21:04:48,790 INFO L226 Difference]: Without dead ends: 3640 [2021-12-17 21:04:48,794 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:48,796 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 363 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:48,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1208 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2021-12-17 21:04:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3456. [2021-12-17 21:04:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3456 states, 2718 states have (on average 1.2781456953642385) internal successors, (3474), 2771 states have internal predecessors, (3474), 367 states have call successors, (367), 298 states have call predecessors, (367), 369 states have return successors, (520), 390 states have call predecessors, (520), 363 states have call successors, (520) [2021-12-17 21:04:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 4361 transitions. [2021-12-17 21:04:48,952 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 4361 transitions. Word has length 69 [2021-12-17 21:04:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:48,953 INFO L470 AbstractCegarLoop]: Abstraction has 3456 states and 4361 transitions. [2021-12-17 21:04:48,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 4361 transitions. [2021-12-17 21:04:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-17 21:04:48,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:48,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:48,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 21:04:48,955 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2021-12-17 21:04:48,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:48,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970338705] [2021-12-17 21:04:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:48,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:49,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970338705] [2021-12-17 21:04:49,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970338705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:49,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:49,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:49,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103396363] [2021-12-17 21:04:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:49,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:49,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:49,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:49,106 INFO L87 Difference]: Start difference. First operand 3456 states and 4361 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:50,214 INFO L93 Difference]: Finished difference Result 5040 states and 6744 transitions. [2021-12-17 21:04:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:04:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2021-12-17 21:04:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:50,228 INFO L225 Difference]: With dead ends: 5040 [2021-12-17 21:04:50,228 INFO L226 Difference]: Without dead ends: 4675 [2021-12-17 21:04:50,233 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:50,233 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 1221 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:50,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1229 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-17 21:04:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2021-12-17 21:04:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4380. [2021-12-17 21:04:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3489 states have (on average 1.3078245915735167) internal successors, (4563), 3557 states have internal predecessors, (4563), 460 states have call successors, (460), 352 states have call predecessors, (460), 429 states have return successors, (667), 474 states have call predecessors, (667), 456 states have call successors, (667) [2021-12-17 21:04:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 5690 transitions. [2021-12-17 21:04:50,423 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 5690 transitions. Word has length 69 [2021-12-17 21:04:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:50,423 INFO L470 AbstractCegarLoop]: Abstraction has 4380 states and 5690 transitions. [2021-12-17 21:04:50,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 21:04:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 5690 transitions. [2021-12-17 21:04:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-17 21:04:50,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:50,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:50,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 21:04:50,425 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2021-12-17 21:04:50,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670322690] [2021-12-17 21:04:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:50,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:50,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:50,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670322690] [2021-12-17 21:04:50,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670322690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:50,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:50,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:50,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956070702] [2021-12-17 21:04:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:50,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:50,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:50,478 INFO L87 Difference]: Start difference. First operand 4380 states and 5690 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2021-12-17 21:04:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:50,872 INFO L93 Difference]: Finished difference Result 7966 states and 10120 transitions. [2021-12-17 21:04:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 21:04:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2021-12-17 21:04:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:50,892 INFO L225 Difference]: With dead ends: 7966 [2021-12-17 21:04:50,892 INFO L226 Difference]: Without dead ends: 4896 [2021-12-17 21:04:50,897 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:50,897 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 566 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:50,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 844 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2021-12-17 21:04:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 4663. [2021-12-17 21:04:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4663 states, 3714 states have (on average 1.3007539041464729) internal successors, (4831), 3785 states have internal predecessors, (4831), 488 states have call successors, (488), 377 states have call predecessors, (488), 459 states have return successors, (701), 504 states have call predecessors, (701), 484 states have call successors, (701) [2021-12-17 21:04:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 6020 transitions. [2021-12-17 21:04:51,065 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 6020 transitions. Word has length 72 [2021-12-17 21:04:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:51,066 INFO L470 AbstractCegarLoop]: Abstraction has 4663 states and 6020 transitions. [2021-12-17 21:04:51,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2021-12-17 21:04:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 6020 transitions. [2021-12-17 21:04:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-17 21:04:51,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:51,067 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:51,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 21:04:51,067 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2021-12-17 21:04:51,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:51,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607693474] [2021-12-17 21:04:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:51,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:51,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607693474] [2021-12-17 21:04:51,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607693474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:51,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:51,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:04:51,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594760314] [2021-12-17 21:04:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:51,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:04:51,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:04:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:04:51,134 INFO L87 Difference]: Start difference. First operand 4663 states and 6020 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) [2021-12-17 21:04:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:51,598 INFO L93 Difference]: Finished difference Result 5717 states and 7287 transitions. [2021-12-17 21:04:51,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 21:04:51,598 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 [2021-12-17 21:04:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:51,611 INFO L225 Difference]: With dead ends: 5717 [2021-12-17 21:04:51,612 INFO L226 Difference]: Without dead ends: 5714 [2021-12-17 21:04:51,614 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:51,614 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 1028 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:51,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 663 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2021-12-17 21:04:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5420. [2021-12-17 21:04:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5420 states, 4292 states have (on average 1.288443616029823) internal successors, (5530), 4370 states have internal predecessors, (5530), 571 states have call successors, (571), 449 states have call predecessors, (571), 555 states have return successors, (829), 604 states have call predecessors, (829), 568 states have call successors, (829) [2021-12-17 21:04:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 6930 transitions. [2021-12-17 21:04:51,873 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 6930 transitions. Word has length 73 [2021-12-17 21:04:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:51,873 INFO L470 AbstractCegarLoop]: Abstraction has 5420 states and 6930 transitions. [2021-12-17 21:04:51,873 INFO L471 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) [2021-12-17 21:04:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 6930 transitions. [2021-12-17 21:04:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-17 21:04:51,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:51,875 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 21:04:51,875 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2021-12-17 21:04:51,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239854281] [2021-12-17 21:04:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:51,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:51,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:51,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239854281] [2021-12-17 21:04:51,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239854281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:51,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297482458] [2021-12-17 21:04:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:51,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:51,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:04:51,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 21:04:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:52,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 21:04:52,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:52,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 21:04:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:52,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297482458] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 21:04:52,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 21:04:52,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-17 21:04:52,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668654589] [2021-12-17 21:04:52,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 21:04:52,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:04:52,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:04:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:04:52,682 INFO L87 Difference]: Start difference. First operand 5420 states and 6930 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) [2021-12-17 21:04:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:54,113 INFO L93 Difference]: Finished difference Result 9839 states and 12304 transitions. [2021-12-17 21:04:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-17 21:04:54,113 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 [2021-12-17 21:04:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:54,135 INFO L225 Difference]: With dead ends: 9839 [2021-12-17 21:04:54,136 INFO L226 Difference]: Without dead ends: 9836 [2021-12-17 21:04:54,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-17 21:04:54,139 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 999 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:54,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 1821 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-17 21:04:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2021-12-17 21:04:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 8979. [2021-12-17 21:04:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8979 states, 7077 states have (on average 1.2664971032923555) internal successors, (8963), 7206 states have internal predecessors, (8963), 941 states have call successors, (941), 774 states have call predecessors, (941), 959 states have return successors, (1375), 1002 states have call predecessors, (1375), 938 states have call successors, (1375) [2021-12-17 21:04:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8979 states to 8979 states and 11279 transitions. [2021-12-17 21:04:54,518 INFO L78 Accepts]: Start accepts. Automaton has 8979 states and 11279 transitions. Word has length 74 [2021-12-17 21:04:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:54,518 INFO L470 AbstractCegarLoop]: Abstraction has 8979 states and 11279 transitions. [2021-12-17 21:04:54,518 INFO L471 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) [2021-12-17 21:04:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8979 states and 11279 transitions. [2021-12-17 21:04:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-17 21:04:54,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:54,520 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:54,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 21:04:54,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:54,737 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2021-12-17 21:04:54,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:54,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091385798] [2021-12-17 21:04:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:54,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:04:54,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:54,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091385798] [2021-12-17 21:04:54,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091385798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:54,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:54,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 21:04:54,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45117853] [2021-12-17 21:04:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:54,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:54,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:04:54,779 INFO L87 Difference]: Start difference. First operand 8979 states and 11279 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) [2021-12-17 21:04:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:55,283 INFO L93 Difference]: Finished difference Result 11988 states and 15003 transitions. [2021-12-17 21:04:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:04:55,284 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 [2021-12-17 21:04:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:55,297 INFO L225 Difference]: With dead ends: 11988 [2021-12-17 21:04:55,298 INFO L226 Difference]: Without dead ends: 5190 [2021-12-17 21:04:55,309 INFO L932 BasicCegarLoop]: 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 [2021-12-17 21:04:55,310 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 516 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:55,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 906 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:04:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2021-12-17 21:04:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 4164. [2021-12-17 21:04:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 3328 states have (on average 1.2872596153846154) internal successors, (4284), 3379 states have internal predecessors, (4284), 441 states have call successors, (441), 339 states have call predecessors, (441), 393 states have return successors, (601), 449 states have call predecessors, (601), 438 states have call successors, (601) [2021-12-17 21:04:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5326 transitions. [2021-12-17 21:04:55,511 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5326 transitions. Word has length 77 [2021-12-17 21:04:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:55,512 INFO L470 AbstractCegarLoop]: Abstraction has 4164 states and 5326 transitions. [2021-12-17 21:04:55,512 INFO L471 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) [2021-12-17 21:04:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5326 transitions. [2021-12-17 21:04:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-17 21:04:55,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:55,514 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:55,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 21:04:55,515 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2021-12-17 21:04:55,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:55,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87366671] [2021-12-17 21:04:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:55,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 21:04:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 21:04:55,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:55,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87366671] [2021-12-17 21:04:55,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87366671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:55,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:55,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 21:04:55,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560081682] [2021-12-17 21:04:55,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:55,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 21:04:55,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 21:04:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:55,580 INFO L87 Difference]: Start difference. First operand 4164 states and 5326 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) [2021-12-17 21:04:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:56,445 INFO L93 Difference]: Finished difference Result 9888 states and 12250 transitions. [2021-12-17 21:04:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 21:04:56,446 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 [2021-12-17 21:04:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:56,464 INFO L225 Difference]: With dead ends: 9888 [2021-12-17 21:04:56,464 INFO L226 Difference]: Without dead ends: 6092 [2021-12-17 21:04:56,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-17 21:04:56,474 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 1079 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:56,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1091 Valid, 1034 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 21:04:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2021-12-17 21:04:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 5861. [2021-12-17 21:04:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5861 states, 4622 states have (on average 1.2520553872782345) internal successors, (5787), 4710 states have internal predecessors, (5787), 625 states have call successors, (625), 497 states have call predecessors, (625), 612 states have return successors, (922), 657 states have call predecessors, (922), 622 states have call successors, (922) [2021-12-17 21:04:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 7334 transitions. [2021-12-17 21:04:56,775 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 7334 transitions. Word has length 84 [2021-12-17 21:04:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:56,775 INFO L470 AbstractCegarLoop]: Abstraction has 5861 states and 7334 transitions. [2021-12-17 21:04:56,775 INFO L471 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) [2021-12-17 21:04:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 7334 transitions. [2021-12-17 21:04:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 21:04:56,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:56,780 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:56,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-17 21:04:56,780 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2021-12-17 21:04:56,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:56,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193778749] [2021-12-17 21:04:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:56,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:04:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 21:04:56,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193778749] [2021-12-17 21:04:56,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193778749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:56,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:04:56,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 21:04:56,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879032003] [2021-12-17 21:04:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:56,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 21:04:56,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 21:04:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:04:56,850 INFO L87 Difference]: Start difference. First operand 5861 states and 7334 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) [2021-12-17 21:04:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:57,833 INFO L93 Difference]: Finished difference Result 8740 states and 10818 transitions. [2021-12-17 21:04:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 21:04:57,835 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 [2021-12-17 21:04:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:57,851 INFO L225 Difference]: With dead ends: 8740 [2021-12-17 21:04:57,852 INFO L226 Difference]: Without dead ends: 4926 [2021-12-17 21:04:57,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-17 21:04:57,862 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 1142 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:57,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 1223 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-17 21:04:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2021-12-17 21:04:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4549. [2021-12-17 21:04:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 3594 states have (on average 1.2548692264885921) internal successors, (4510), 3665 states have internal predecessors, (4510), 483 states have call successors, (483), 373 states have call predecessors, (483), 470 states have return successors, (687), 514 states have call predecessors, (687), 480 states have call successors, (687) [2021-12-17 21:04:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 5680 transitions. [2021-12-17 21:04:58,126 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 5680 transitions. Word has length 93 [2021-12-17 21:04:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:58,127 INFO L470 AbstractCegarLoop]: Abstraction has 4549 states and 5680 transitions. [2021-12-17 21:04:58,127 INFO L471 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) [2021-12-17 21:04:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 5680 transitions. [2021-12-17 21:04:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-17 21:04:58,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:58,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:58,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 21:04:58,132 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2021-12-17 21:04:58,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:58,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074188608] [2021-12-17 21:04:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:58,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:04:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:04:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:04:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:04:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:04:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-17 21:04:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-17 21:04:58,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074188608] [2021-12-17 21:04:58,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074188608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:58,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279510587] [2021-12-17 21:04:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:58,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:58,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:04:58,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 21:04:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:58,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:04:58,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:04:58,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:04:58,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279510587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:58,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:04:58,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:04:58,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735642328] [2021-12-17 21:04:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:58,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:04:58,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:04:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:58,401 INFO L87 Difference]: Start difference. First operand 4549 states and 5680 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:04:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:58,711 INFO L93 Difference]: Finished difference Result 6436 states and 8440 transitions. [2021-12-17 21:04:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:04:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2021-12-17 21:04:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:58,725 INFO L225 Difference]: With dead ends: 6436 [2021-12-17 21:04:58,726 INFO L226 Difference]: Without dead ends: 4867 [2021-12-17 21:04:58,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:04:58,733 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 140 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:58,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 750 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:04:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2021-12-17 21:04:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867. [2021-12-17 21:04:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 3862 states have (on average 1.264629725530813) internal successors, (4884), 3935 states have internal predecessors, (4884), 513 states have call successors, (513), 391 states have call predecessors, (513), 490 states have return successors, (733), 544 states have call predecessors, (733), 510 states have call successors, (733) [2021-12-17 21:04:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6130 transitions. [2021-12-17 21:04:59,025 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6130 transitions. Word has length 111 [2021-12-17 21:04:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:59,025 INFO L470 AbstractCegarLoop]: Abstraction has 4867 states and 6130 transitions. [2021-12-17 21:04:59,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:04:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6130 transitions. [2021-12-17 21:04:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-17 21:04:59,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:59,032 INFO L514 BasicCegarLoop]: 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] [2021-12-17 21:04:59,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 21:04:59,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-17 21:04:59,253 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:04:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:04:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2021-12-17 21:04:59,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:04:59,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835504112] [2021-12-17 21:04:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:59,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:04:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:04:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:04:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:04:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:04:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:04:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-17 21:04:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:04:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 21:04:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-17 21:04:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:04:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:04:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-17 21:04:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-17 21:04:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-17 21:04:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-17 21:04:59,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:04:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835504112] [2021-12-17 21:04:59,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835504112] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:04:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328193047] [2021-12-17 21:04:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:04:59,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:04:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:04:59,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:04:59,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 21:04:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:04:59,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 21:04:59,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:04:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 21:04:59,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:04:59,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328193047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:04:59,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:04:59,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-17 21:04:59,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839161705] [2021-12-17 21:04:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:04:59,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 21:04:59,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:04:59,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 21:04:59,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:04:59,611 INFO L87 Difference]: Start difference. First operand 4867 states and 6130 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) [2021-12-17 21:04:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:04:59,741 INFO L93 Difference]: Finished difference Result 6546 states and 8143 transitions. [2021-12-17 21:04:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:04:59,741 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 [2021-12-17 21:04:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:04:59,748 INFO L225 Difference]: With dead ends: 6546 [2021-12-17 21:04:59,749 INFO L226 Difference]: Without dead ends: 3309 [2021-12-17 21:04:59,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-17 21:04:59,754 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 34 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:04:59,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1568 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:04:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2021-12-17 21:04:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3186. [2021-12-17 21:04:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 2623 states have (on average 1.3015630956919557) internal successors, (3414), 2657 states have internal predecessors, (3414), 305 states have call successors, (305), 208 states have call predecessors, (305), 256 states have return successors, (439), 322 states have call predecessors, (439), 302 states have call successors, (439) [2021-12-17 21:04:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4158 transitions. [2021-12-17 21:04:59,901 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4158 transitions. Word has length 145 [2021-12-17 21:04:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:04:59,901 INFO L470 AbstractCegarLoop]: Abstraction has 3186 states and 4158 transitions. [2021-12-17 21:04:59,901 INFO L471 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) [2021-12-17 21:04:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4158 transitions. [2021-12-17 21:04:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-17 21:04:59,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:04:59,905 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:04:59,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:00,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:00,119 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:00,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2021-12-17 21:05:00,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:00,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922315341] [2021-12-17 21:05:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:00,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:05:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-17 21:05:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 21:05:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:05:00,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:00,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922315341] [2021-12-17 21:05:00,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922315341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:00,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684950341] [2021-12-17 21:05:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:00,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:00,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:00,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 21:05:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:00,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:00,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:05:00,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:00,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684950341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:00,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:00,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 21:05:00,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211583912] [2021-12-17 21:05:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:00,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:00,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:00,461 INFO L87 Difference]: Start difference. First operand 3186 states and 4158 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 21:05:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:00,612 INFO L93 Difference]: Finished difference Result 6339 states and 8773 transitions. [2021-12-17 21:05:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2021-12-17 21:05:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:00,621 INFO L225 Difference]: With dead ends: 6339 [2021-12-17 21:05:00,622 INFO L226 Difference]: Without dead ends: 4732 [2021-12-17 21:05:00,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:00,626 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 233 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:00,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 496 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2021-12-17 21:05:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 4698. [2021-12-17 21:05:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 3889 states have (on average 1.3373617896631524) internal successors, (5201), 3942 states have internal predecessors, (5201), 451 states have call successors, (451), 298 states have call predecessors, (451), 356 states have return successors, (651), 459 states have call predecessors, (651), 448 states have call successors, (651) [2021-12-17 21:05:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 6303 transitions. [2021-12-17 21:05:00,805 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 6303 transitions. Word has length 143 [2021-12-17 21:05:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:00,805 INFO L470 AbstractCegarLoop]: Abstraction has 4698 states and 6303 transitions. [2021-12-17 21:05:00,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 21:05:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 6303 transitions. [2021-12-17 21:05:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-12-17 21:05:00,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:00,810 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:00,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:01,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:01,028 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2021-12-17 21:05:01,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:01,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608478148] [2021-12-17 21:05:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:01,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:05:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 21:05:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 21:05:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:05:01,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608478148] [2021-12-17 21:05:01,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608478148] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626544343] [2021-12-17 21:05:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:01,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:01,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 21:05:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:01,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:01,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:05:01,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:01,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626544343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:01,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:01,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 21:05:01,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107038255] [2021-12-17 21:05:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:01,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:01,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:01,414 INFO L87 Difference]: Start difference. First operand 4698 states and 6303 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 21:05:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:01,868 INFO L93 Difference]: Finished difference Result 9080 states and 12660 transitions. [2021-12-17 21:05:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2021-12-17 21:05:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:01,889 INFO L225 Difference]: With dead ends: 9080 [2021-12-17 21:05:01,890 INFO L226 Difference]: Without dead ends: 6550 [2021-12-17 21:05:01,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:01,901 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 234 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:01,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 518 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2021-12-17 21:05:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6498. [2021-12-17 21:05:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 5409 states have (on average 1.3595858753928638) internal successors, (7354), 5480 states have internal predecessors, (7354), 615 states have call successors, (615), 402 states have call predecessors, (615), 472 states have return successors, (873), 617 states have call predecessors, (873), 612 states have call successors, (873) [2021-12-17 21:05:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 8842 transitions. [2021-12-17 21:05:02,318 INFO L78 Accepts]: Start accepts. Automaton has 6498 states and 8842 transitions. Word has length 143 [2021-12-17 21:05:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:02,319 INFO L470 AbstractCegarLoop]: Abstraction has 6498 states and 8842 transitions. [2021-12-17 21:05:02,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 21:05:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6498 states and 8842 transitions. [2021-12-17 21:05:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-17 21:05:02,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:02,328 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:02,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:02,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-17 21:05:02,556 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2021-12-17 21:05:02,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691818624] [2021-12-17 21:05:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:02,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:05:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:05:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:05:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:05:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:05:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:05:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-17 21:05:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-17 21:05:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:05:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:05:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-17 21:05:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-17 21:05:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-17 21:05:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-17 21:05:02,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:02,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691818624] [2021-12-17 21:05:02,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691818624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:02,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:05:02,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:05:02,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14442931] [2021-12-17 21:05:02,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:02,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:05:02,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:05:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:05:02,636 INFO L87 Difference]: Start difference. First operand 6498 states and 8842 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 21:05:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:03,216 INFO L93 Difference]: Finished difference Result 7781 states and 10362 transitions. [2021-12-17 21:05:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:05:03,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2021-12-17 21:05:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:03,232 INFO L225 Difference]: With dead ends: 7781 [2021-12-17 21:05:03,232 INFO L226 Difference]: Without dead ends: 6391 [2021-12-17 21:05:03,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:05:03,237 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 276 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:03,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 1182 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:05:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2021-12-17 21:05:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 6245. [2021-12-17 21:05:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6245 states, 5207 states have (on average 1.368158248511619) internal successors, (7124), 5278 states have internal predecessors, (7124), 590 states have call successors, (590), 381 states have call predecessors, (590), 446 states have return successors, (835), 587 states have call predecessors, (835), 587 states have call successors, (835) [2021-12-17 21:05:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6245 states to 6245 states and 8549 transitions. [2021-12-17 21:05:03,556 INFO L78 Accepts]: Start accepts. Automaton has 6245 states and 8549 transitions. Word has length 159 [2021-12-17 21:05:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:03,556 INFO L470 AbstractCegarLoop]: Abstraction has 6245 states and 8549 transitions. [2021-12-17 21:05:03,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-17 21:05:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6245 states and 8549 transitions. [2021-12-17 21:05:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-17 21:05:03,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:03,564 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:03,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-17 21:05:03,565 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2021-12-17 21:05:03,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:03,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180449748] [2021-12-17 21:05:03,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:03,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 21:05:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:05:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:05:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-17 21:05:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-17 21:05:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-17 21:05:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-17 21:05:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-17 21:05:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 21:05:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 21:05:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:05:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-17 21:05:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-17 21:05:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-17 21:05:03,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:03,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180449748] [2021-12-17 21:05:03,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180449748] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:03,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263464770] [2021-12-17 21:05:03,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:03,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:03,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:03,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 21:05:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:03,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 21:05:03,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-17 21:05:04,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:04,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263464770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:04,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:04,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2021-12-17 21:05:04,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137082499] [2021-12-17 21:05:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:04,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 21:05:04,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 21:05:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:05:04,066 INFO L87 Difference]: Start difference. First operand 6245 states and 8549 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 21:05:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:04,524 INFO L93 Difference]: Finished difference Result 8571 states and 11357 transitions. [2021-12-17 21:05:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 21:05:04,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2021-12-17 21:05:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:04,546 INFO L225 Difference]: With dead ends: 8571 [2021-12-17 21:05:04,547 INFO L226 Difference]: Without dead ends: 7161 [2021-12-17 21:05:04,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-17 21:05:04,554 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 175 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:04,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 632 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 21:05:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2021-12-17 21:05:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7119. [2021-12-17 21:05:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7119 states, 5938 states have (on average 1.3406871000336813) internal successors, (7961), 6013 states have internal predecessors, (7961), 660 states have call successors, (660), 432 states have call predecessors, (660), 519 states have return successors, (946), 675 states have call predecessors, (946), 657 states have call successors, (946) [2021-12-17 21:05:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7119 states to 7119 states and 9567 transitions. [2021-12-17 21:05:05,022 INFO L78 Accepts]: Start accepts. Automaton has 7119 states and 9567 transitions. Word has length 162 [2021-12-17 21:05:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:05,022 INFO L470 AbstractCegarLoop]: Abstraction has 7119 states and 9567 transitions. [2021-12-17 21:05:05,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-17 21:05:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7119 states and 9567 transitions. [2021-12-17 21:05:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 21:05:05,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:05,029 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:05,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:05,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-17 21:05:05,251 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2021-12-17 21:05:05,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589870086] [2021-12-17 21:05:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:05,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 21:05:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 21:05:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 21:05:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:05:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-17 21:05:05,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:05,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589870086] [2021-12-17 21:05:05,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589870086] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:05,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724485958] [2021-12-17 21:05:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:05,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:05,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:05,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:05,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 21:05:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:05,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:05,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-17 21:05:05,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:05,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724485958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:05,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:05,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:05,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530361284] [2021-12-17 21:05:05,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:05,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:05,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:05,583 INFO L87 Difference]: Start difference. First operand 7119 states and 9567 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:05,985 INFO L93 Difference]: Finished difference Result 12903 states and 17788 transitions. [2021-12-17 21:05:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:05,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 160 [2021-12-17 21:05:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:06,009 INFO L225 Difference]: With dead ends: 12903 [2021-12-17 21:05:06,010 INFO L226 Difference]: Without dead ends: 7985 [2021-12-17 21:05:06,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:06,027 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 297 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:06,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 357 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2021-12-17 21:05:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 7814. [2021-12-17 21:05:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 6577 states have (on average 1.3097156758400486) internal successors, (8614), 6646 states have internal predecessors, (8614), 668 states have call successors, (668), 476 states have call predecessors, (668), 567 states have return successors, (946), 693 states have call predecessors, (946), 665 states have call successors, (946) [2021-12-17 21:05:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 10228 transitions. [2021-12-17 21:05:06,522 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 10228 transitions. Word has length 160 [2021-12-17 21:05:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:06,523 INFO L470 AbstractCegarLoop]: Abstraction has 7814 states and 10228 transitions. [2021-12-17 21:05:06,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 10228 transitions. [2021-12-17 21:05:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 21:05:06,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:06,530 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:06,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:06,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:06,761 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2021-12-17 21:05:06,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:06,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899004235] [2021-12-17 21:05:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:06,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 21:05:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 21:05:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-17 21:05:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:05:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-17 21:05:06,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899004235] [2021-12-17 21:05:06,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899004235] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230780455] [2021-12-17 21:05:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:06,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:06,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:06,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 21:05:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:06,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:05:06,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 21:05:07,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:07,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230780455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:07,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:07,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:07,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174372610] [2021-12-17 21:05:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:07,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:07,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:07,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:07,146 INFO L87 Difference]: Start difference. First operand 7814 states and 10228 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:07,516 INFO L93 Difference]: Finished difference Result 13351 states and 17969 transitions. [2021-12-17 21:05:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2021-12-17 21:05:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:07,537 INFO L225 Difference]: With dead ends: 13351 [2021-12-17 21:05:07,537 INFO L226 Difference]: Without dead ends: 7951 [2021-12-17 21:05:07,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:07,549 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 253 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:07,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 367 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2021-12-17 21:05:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 7939. [2021-12-17 21:05:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7939 states, 6686 states have (on average 1.291803769069698) internal successors, (8637), 6749 states have internal predecessors, (8637), 666 states have call successors, (666), 492 states have call predecessors, (666), 585 states have return successors, (999), 698 states have call predecessors, (999), 663 states have call successors, (999) [2021-12-17 21:05:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 10302 transitions. [2021-12-17 21:05:08,040 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 10302 transitions. Word has length 160 [2021-12-17 21:05:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:08,041 INFO L470 AbstractCegarLoop]: Abstraction has 7939 states and 10302 transitions. [2021-12-17 21:05:08,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 10302 transitions. [2021-12-17 21:05:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-17 21:05:08,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:08,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:08,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:08,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:08,263 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2021-12-17 21:05:08,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:08,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553240132] [2021-12-17 21:05:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:08,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 21:05:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-17 21:05:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-17 21:05:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-17 21:05:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-17 21:05:08,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553240132] [2021-12-17 21:05:08,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553240132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:08,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686792503] [2021-12-17 21:05:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:08,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:08,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:08,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 21:05:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:08,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:05:08,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-17 21:05:08,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:08,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686792503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:08,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:08,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:08,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070713387] [2021-12-17 21:05:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:08,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:08,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:08,584 INFO L87 Difference]: Start difference. First operand 7939 states and 10302 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2021-12-17 21:05:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:08,988 INFO L93 Difference]: Finished difference Result 13621 states and 17995 transitions. [2021-12-17 21:05:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 160 [2021-12-17 21:05:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:09,012 INFO L225 Difference]: With dead ends: 13621 [2021-12-17 21:05:09,013 INFO L226 Difference]: Without dead ends: 7883 [2021-12-17 21:05:09,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:09,024 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 279 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:09,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7883 states. [2021-12-17 21:05:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7883 to 7883. [2021-12-17 21:05:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7883 states, 6630 states have (on average 1.2773755656108596) internal successors, (8469), 6693 states have internal predecessors, (8469), 666 states have call successors, (666), 492 states have call predecessors, (666), 585 states have return successors, (999), 698 states have call predecessors, (999), 663 states have call successors, (999) [2021-12-17 21:05:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7883 states to 7883 states and 10134 transitions. [2021-12-17 21:05:09,361 INFO L78 Accepts]: Start accepts. Automaton has 7883 states and 10134 transitions. Word has length 160 [2021-12-17 21:05:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:09,361 INFO L470 AbstractCegarLoop]: Abstraction has 7883 states and 10134 transitions. [2021-12-17 21:05:09,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2021-12-17 21:05:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7883 states and 10134 transitions. [2021-12-17 21:05:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-17 21:05:09,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:09,365 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-17 21:05:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:09,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:09,577 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2021-12-17 21:05:09,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:09,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279330310] [2021-12-17 21:05:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:09,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:05:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-17 21:05:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 21:05:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 21:05:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-12-17 21:05:09,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279330310] [2021-12-17 21:05:09,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279330310] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:09,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458558067] [2021-12-17 21:05:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:09,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:09,684 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:09,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 21:05:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:09,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:09,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 21:05:09,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:09,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458558067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:09,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:09,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:09,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68355571] [2021-12-17 21:05:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:09,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:09,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:09,941 INFO L87 Difference]: Start difference. First operand 7883 states and 10134 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:05:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:10,522 INFO L93 Difference]: Finished difference Result 18971 states and 25116 transitions. [2021-12-17 21:05:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-17 21:05:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:10,555 INFO L225 Difference]: With dead ends: 18971 [2021-12-17 21:05:10,555 INFO L226 Difference]: Without dead ends: 13289 [2021-12-17 21:05:10,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:10,569 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 151 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:10,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 777 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13289 states. [2021-12-17 21:05:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13289 to 13285. [2021-12-17 21:05:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13285 states, 11225 states have (on average 1.2871269487750556) internal successors, (14448), 11333 states have internal predecessors, (14448), 1109 states have call successors, (1109), 820 states have call predecessors, (1109), 949 states have return successors, (1915), 1133 states have call predecessors, (1915), 1106 states have call successors, (1915) [2021-12-17 21:05:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13285 states to 13285 states and 17472 transitions. [2021-12-17 21:05:11,262 INFO L78 Accepts]: Start accepts. Automaton has 13285 states and 17472 transitions. Word has length 161 [2021-12-17 21:05:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:11,262 INFO L470 AbstractCegarLoop]: Abstraction has 13285 states and 17472 transitions. [2021-12-17 21:05:11,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:05:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 13285 states and 17472 transitions. [2021-12-17 21:05:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-17 21:05:11,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:11,267 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:11,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:11,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-17 21:05:11,484 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2021-12-17 21:05:11,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045021239] [2021-12-17 21:05:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:11,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 21:05:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 21:05:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 21:05:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 21:05:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-17 21:05:11,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:11,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045021239] [2021-12-17 21:05:11,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045021239] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:11,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889258464] [2021-12-17 21:05:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:11,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:11,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:11,566 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:11,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 21:05:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:11,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:05:11,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 21:05:11,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:11,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889258464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:11,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:11,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:11,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515382041] [2021-12-17 21:05:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:11,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:11,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:11,846 INFO L87 Difference]: Start difference. First operand 13285 states and 17472 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 21:05:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:13,110 INFO L93 Difference]: Finished difference Result 35094 states and 47572 transitions. [2021-12-17 21:05:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2021-12-17 21:05:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:13,181 INFO L225 Difference]: With dead ends: 35094 [2021-12-17 21:05:13,181 INFO L226 Difference]: Without dead ends: 24014 [2021-12-17 21:05:13,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:13,208 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 278 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:13,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 531 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24014 states. [2021-12-17 21:05:14,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24014 to 23842. [2021-12-17 21:05:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23842 states, 20218 states have (on average 1.2894450489662677) internal successors, (26070), 20416 states have internal predecessors, (26070), 1963 states have call successors, (1963), 1460 states have call predecessors, (1963), 1659 states have return successors, (4281), 1969 states have call predecessors, (4281), 1960 states have call successors, (4281) [2021-12-17 21:05:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23842 states to 23842 states and 32314 transitions. [2021-12-17 21:05:14,691 INFO L78 Accepts]: Start accepts. Automaton has 23842 states and 32314 transitions. Word has length 161 [2021-12-17 21:05:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:14,691 INFO L470 AbstractCegarLoop]: Abstraction has 23842 states and 32314 transitions. [2021-12-17 21:05:14,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 21:05:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23842 states and 32314 transitions. [2021-12-17 21:05:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-17 21:05:14,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:14,701 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:14,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:14,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-17 21:05:14,918 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2021-12-17 21:05:14,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338307512] [2021-12-17 21:05:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:14,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 21:05:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-17 21:05:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-17 21:05:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-17 21:05:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-17 21:05:15,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:15,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338307512] [2021-12-17 21:05:15,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338307512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:15,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:05:15,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:05:15,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216993566] [2021-12-17 21:05:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:15,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:15,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:05:15,019 INFO L87 Difference]: Start difference. First operand 23842 states and 32314 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:05:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:16,474 INFO L93 Difference]: Finished difference Result 43512 states and 59209 transitions. [2021-12-17 21:05:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 21:05:16,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2021-12-17 21:05:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:16,533 INFO L225 Difference]: With dead ends: 43512 [2021-12-17 21:05:16,533 INFO L226 Difference]: Without dead ends: 21873 [2021-12-17 21:05:16,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:05:16,567 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 416 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:16,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 639 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:05:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21873 states. [2021-12-17 21:05:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21873 to 20174. [2021-12-17 21:05:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20174 states, 17080 states have (on average 1.2848946135831383) internal successors, (21946), 17424 states have internal predecessors, (21946), 1525 states have call successors, (1525), 1132 states have call predecessors, (1525), 1567 states have return successors, (3734), 1619 states have call predecessors, (3734), 1522 states have call successors, (3734) [2021-12-17 21:05:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20174 states to 20174 states and 27205 transitions. [2021-12-17 21:05:17,633 INFO L78 Accepts]: Start accepts. Automaton has 20174 states and 27205 transitions. Word has length 161 [2021-12-17 21:05:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:17,634 INFO L470 AbstractCegarLoop]: Abstraction has 20174 states and 27205 transitions. [2021-12-17 21:05:17,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-17 21:05:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 20174 states and 27205 transitions. [2021-12-17 21:05:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:05:17,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:17,642 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:17,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-17 21:05:17,642 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2021-12-17 21:05:17,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227320129] [2021-12-17 21:05:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:17,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:05:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 21:05:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:05:17,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227320129] [2021-12-17 21:05:17,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227320129] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139785245] [2021-12-17 21:05:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:17,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:17,722 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:17,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-17 21:05:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:17,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:05:17,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 21:05:17,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:17,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139785245] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:17,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:17,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:17,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328103437] [2021-12-17 21:05:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:18,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:18,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:18,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:18,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:18,000 INFO L87 Difference]: Start difference. First operand 20174 states and 27205 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:05:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:18,859 INFO L93 Difference]: Finished difference Result 29455 states and 41380 transitions. [2021-12-17 21:05:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2021-12-17 21:05:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:18,936 INFO L225 Difference]: With dead ends: 29455 [2021-12-17 21:05:18,936 INFO L226 Difference]: Without dead ends: 20226 [2021-12-17 21:05:18,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:18,968 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 138 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:18,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 728 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states. [2021-12-17 21:05:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20162. [2021-12-17 21:05:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20162 states, 17068 states have (on average 1.268748535270682) internal successors, (21655), 17412 states have internal predecessors, (21655), 1525 states have call successors, (1525), 1132 states have call predecessors, (1525), 1567 states have return successors, (3734), 1619 states have call predecessors, (3734), 1522 states have call successors, (3734) [2021-12-17 21:05:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20162 states to 20162 states and 26914 transitions. [2021-12-17 21:05:20,025 INFO L78 Accepts]: Start accepts. Automaton has 20162 states and 26914 transitions. Word has length 163 [2021-12-17 21:05:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:20,030 INFO L470 AbstractCegarLoop]: Abstraction has 20162 states and 26914 transitions. [2021-12-17 21:05:20,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 21:05:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20162 states and 26914 transitions. [2021-12-17 21:05:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-17 21:05:20,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:20,038 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:20,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-17 21:05:20,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-17 21:05:20,252 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2021-12-17 21:05:20,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:20,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399365176] [2021-12-17 21:05:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:20,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 21:05:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-17 21:05:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:05:20,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:20,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399365176] [2021-12-17 21:05:20,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399365176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:20,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971108907] [2021-12-17 21:05:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:20,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:20,338 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:20,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-17 21:05:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:20,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:20,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 21:05:20,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:20,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971108907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:20,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:20,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:20,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560427514] [2021-12-17 21:05:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:20,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:20,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:20,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:20,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:20,756 INFO L87 Difference]: Start difference. First operand 20162 states and 26914 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:22,023 INFO L93 Difference]: Finished difference Result 39379 states and 54061 transitions. [2021-12-17 21:05:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2021-12-17 21:05:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:22,074 INFO L225 Difference]: With dead ends: 39379 [2021-12-17 21:05:22,074 INFO L226 Difference]: Without dead ends: 21422 [2021-12-17 21:05:22,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:22,105 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 266 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:22,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2021-12-17 21:05:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 19088. [2021-12-17 21:05:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19088 states, 16254 states have (on average 1.2326811861695584) internal successors, (20036), 16586 states have internal predecessors, (20036), 1365 states have call successors, (1365), 1048 states have call predecessors, (1365), 1467 states have return successors, (3060), 1455 states have call predecessors, (3060), 1362 states have call successors, (3060) [2021-12-17 21:05:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19088 states to 19088 states and 24461 transitions. [2021-12-17 21:05:23,375 INFO L78 Accepts]: Start accepts. Automaton has 19088 states and 24461 transitions. Word has length 163 [2021-12-17 21:05:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:23,376 INFO L470 AbstractCegarLoop]: Abstraction has 19088 states and 24461 transitions. [2021-12-17 21:05:23,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 21:05:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 19088 states and 24461 transitions. [2021-12-17 21:05:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-17 21:05:23,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:23,383 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:23,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:23,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-17 21:05:23,593 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2021-12-17 21:05:23,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:23,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985822734] [2021-12-17 21:05:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:23,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:05:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:05:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:05:23,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985822734] [2021-12-17 21:05:23,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985822734] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432925865] [2021-12-17 21:05:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:23,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:23,701 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:23,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-17 21:05:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:23,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 21:05:23,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 21:05:24,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:24,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432925865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:24,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:24,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 21:05:24,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183757245] [2021-12-17 21:05:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:24,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:24,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:24,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:05:24,055 INFO L87 Difference]: Start difference. First operand 19088 states and 24461 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:25,211 INFO L93 Difference]: Finished difference Result 35891 states and 46479 transitions. [2021-12-17 21:05:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 21:05:25,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-17 21:05:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:25,261 INFO L225 Difference]: With dead ends: 35891 [2021-12-17 21:05:25,261 INFO L226 Difference]: Without dead ends: 19008 [2021-12-17 21:05:25,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:05:25,294 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 357 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:25,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 577 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 21:05:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19008 states. [2021-12-17 21:05:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19008 to 19008. [2021-12-17 21:05:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19008 states, 16174 states have (on average 1.2076171633485842) internal successors, (19532), 16506 states have internal predecessors, (19532), 1365 states have call successors, (1365), 1048 states have call predecessors, (1365), 1467 states have return successors, (3060), 1455 states have call predecessors, (3060), 1362 states have call successors, (3060) [2021-12-17 21:05:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19008 states to 19008 states and 23957 transitions. [2021-12-17 21:05:26,288 INFO L78 Accepts]: Start accepts. Automaton has 19008 states and 23957 transitions. Word has length 165 [2021-12-17 21:05:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:26,288 INFO L470 AbstractCegarLoop]: Abstraction has 19008 states and 23957 transitions. [2021-12-17 21:05:26,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19008 states and 23957 transitions. [2021-12-17 21:05:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-17 21:05:26,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:26,295 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:26,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:26,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:26,512 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash 770599474, now seen corresponding path program 1 times [2021-12-17 21:05:26,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:26,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967436391] [2021-12-17 21:05:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:26,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:05:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:05:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:05:26,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:26,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967436391] [2021-12-17 21:05:26,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967436391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:26,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674212531] [2021-12-17 21:05:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:26,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:26,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:26,583 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:26,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-17 21:05:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:26,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 21:05:26,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-17 21:05:26,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:26,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674212531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:26,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:26,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 21:05:26,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771423323] [2021-12-17 21:05:26,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:26,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:26,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:05:26,919 INFO L87 Difference]: Start difference. First operand 19008 states and 23957 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:28,164 INFO L93 Difference]: Finished difference Result 35711 states and 45619 transitions. [2021-12-17 21:05:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 21:05:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-17 21:05:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:28,214 INFO L225 Difference]: With dead ends: 35711 [2021-12-17 21:05:28,214 INFO L226 Difference]: Without dead ends: 18904 [2021-12-17 21:05:28,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 21:05:28,247 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 351 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:28,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 570 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 21:05:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18904 states. [2021-12-17 21:05:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18904 to 18904. [2021-12-17 21:05:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18904 states, 16070 states have (on average 1.1771001866832607) internal successors, (18916), 16402 states have internal predecessors, (18916), 1365 states have call successors, (1365), 1048 states have call predecessors, (1365), 1467 states have return successors, (3020), 1455 states have call predecessors, (3020), 1362 states have call successors, (3020) [2021-12-17 21:05:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18904 states to 18904 states and 23301 transitions. [2021-12-17 21:05:29,303 INFO L78 Accepts]: Start accepts. Automaton has 18904 states and 23301 transitions. Word has length 165 [2021-12-17 21:05:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:29,303 INFO L470 AbstractCegarLoop]: Abstraction has 18904 states and 23301 transitions. [2021-12-17 21:05:29,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18904 states and 23301 transitions. [2021-12-17 21:05:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-17 21:05:29,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:29,312 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:29,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:29,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-17 21:05:29,529 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2021-12-17 21:05:29,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:29,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093508277] [2021-12-17 21:05:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:29,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:05:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:05:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 21:05:29,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:29,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093508277] [2021-12-17 21:05:29,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093508277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:29,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87426248] [2021-12-17 21:05:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:29,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:29,619 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:29,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-17 21:05:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:29,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 21:05:29,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 21:05:29,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:29,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87426248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:29,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:29,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 21:05:29,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051606474] [2021-12-17 21:05:29,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:29,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:29,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:05:29,927 INFO L87 Difference]: Start difference. First operand 18904 states and 23301 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:31,171 INFO L93 Difference]: Finished difference Result 35336 states and 44595 transitions. [2021-12-17 21:05:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:05:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-17 21:05:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:31,218 INFO L225 Difference]: With dead ends: 35336 [2021-12-17 21:05:31,222 INFO L226 Difference]: Without dead ends: 18635 [2021-12-17 21:05:31,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:05:31,255 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 49 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:31,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1242 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18635 states. [2021-12-17 21:05:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18635 to 18243. [2021-12-17 21:05:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18243 states, 15429 states have (on average 1.1585326333527772) internal successors, (17875), 15747 states have internal predecessors, (17875), 1365 states have call successors, (1365), 1048 states have call predecessors, (1365), 1447 states have return successors, (2798), 1449 states have call predecessors, (2798), 1362 states have call successors, (2798) [2021-12-17 21:05:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18243 states to 18243 states and 22038 transitions. [2021-12-17 21:05:32,235 INFO L78 Accepts]: Start accepts. Automaton has 18243 states and 22038 transitions. Word has length 165 [2021-12-17 21:05:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:32,236 INFO L470 AbstractCegarLoop]: Abstraction has 18243 states and 22038 transitions. [2021-12-17 21:05:32,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 18243 states and 22038 transitions. [2021-12-17 21:05:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-17 21:05:32,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:32,242 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:32,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-17 21:05:32,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-17 21:05:32,455 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2021-12-17 21:05:32,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:32,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478381708] [2021-12-17 21:05:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:32,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 21:05:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-17 21:05:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 21:05:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-17 21:05:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-17 21:05:32,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:32,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478381708] [2021-12-17 21:05:32,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478381708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:32,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822413196] [2021-12-17 21:05:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:32,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:32,588 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:32,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-17 21:05:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:32,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 21:05:32,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-17 21:05:32,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:32,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822413196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:32,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:32,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 21:05:32,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540825200] [2021-12-17 21:05:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:32,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:32,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:05:32,869 INFO L87 Difference]: Start difference. First operand 18243 states and 22038 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:33,800 INFO L93 Difference]: Finished difference Result 28847 states and 35228 transitions. [2021-12-17 21:05:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:05:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2021-12-17 21:05:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:33,835 INFO L225 Difference]: With dead ends: 28847 [2021-12-17 21:05:33,836 INFO L226 Difference]: Without dead ends: 16597 [2021-12-17 21:05:33,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 21:05:33,855 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 10 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:33,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1227 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16597 states. [2021-12-17 21:05:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16597 to 16557. [2021-12-17 21:05:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16557 states, 14121 states have (on average 1.1404999645917429) internal successors, (16105), 14301 states have internal predecessors, (16105), 1245 states have call successors, (1245), 960 states have call predecessors, (1245), 1189 states have return successors, (1995), 1297 states have call predecessors, (1995), 1242 states have call successors, (1995) [2021-12-17 21:05:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16557 states to 16557 states and 19345 transitions. [2021-12-17 21:05:34,718 INFO L78 Accepts]: Start accepts. Automaton has 16557 states and 19345 transitions. Word has length 165 [2021-12-17 21:05:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:34,718 INFO L470 AbstractCegarLoop]: Abstraction has 16557 states and 19345 transitions. [2021-12-17 21:05:34,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 21:05:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 16557 states and 19345 transitions. [2021-12-17 21:05:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-17 21:05:34,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:34,724 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:34,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:34,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-17 21:05:34,932 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2021-12-17 21:05:34,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:34,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089303521] [2021-12-17 21:05:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:34,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-17 21:05:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-17 21:05:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 21:05:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-17 21:05:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-17 21:05:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-17 21:05:35,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089303521] [2021-12-17 21:05:35,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089303521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:35,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738553348] [2021-12-17 21:05:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:35,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:35,010 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:35,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-17 21:05:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:35,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 21:05:35,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-17 21:05:35,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:35,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738553348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:35,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:35,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 21:05:35,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141468650] [2021-12-17 21:05:35,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:35,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:35,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:35,329 INFO L87 Difference]: Start difference. First operand 16557 states and 19345 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:05:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:36,204 INFO L93 Difference]: Finished difference Result 26070 states and 30581 transitions. [2021-12-17 21:05:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:36,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2021-12-17 21:05:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:36,236 INFO L225 Difference]: With dead ends: 26070 [2021-12-17 21:05:36,237 INFO L226 Difference]: Without dead ends: 15780 [2021-12-17 21:05:36,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-17 21:05:36,252 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 137 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:36,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 699 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15780 states. [2021-12-17 21:05:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15780 to 15776. [2021-12-17 21:05:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15776 states, 13456 states have (on average 1.1379310344827587) internal successors, (15312), 13630 states have internal predecessors, (15312), 1183 states have call successors, (1183), 910 states have call predecessors, (1183), 1135 states have return successors, (1881), 1237 states have call predecessors, (1881), 1180 states have call successors, (1881) [2021-12-17 21:05:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15776 states to 15776 states and 18376 transitions. [2021-12-17 21:05:37,255 INFO L78 Accepts]: Start accepts. Automaton has 15776 states and 18376 transitions. Word has length 200 [2021-12-17 21:05:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:37,255 INFO L470 AbstractCegarLoop]: Abstraction has 15776 states and 18376 transitions. [2021-12-17 21:05:37,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-17 21:05:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15776 states and 18376 transitions. [2021-12-17 21:05:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-17 21:05:37,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:37,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:37,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-17 21:05:37,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:37,479 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2021-12-17 21:05:37,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844672207] [2021-12-17 21:05:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:37,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 21:05:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 21:05:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:05:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-17 21:05:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-17 21:05:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-17 21:05:37,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844672207] [2021-12-17 21:05:37,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844672207] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:05:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028187822] [2021-12-17 21:05:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:37,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:05:37,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:05:37,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-17 21:05:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:37,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 21:05:37,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:05:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-17 21:05:37,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 21:05:37,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028187822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:37,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 21:05:37,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-17 21:05:37,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053623105] [2021-12-17 21:05:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:37,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:05:37,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:37,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:05:37,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:05:37,967 INFO L87 Difference]: Start difference. First operand 15776 states and 18376 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 21:05:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:38,816 INFO L93 Difference]: Finished difference Result 25186 states and 29914 transitions. [2021-12-17 21:05:38,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:05:38,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2021-12-17 21:05:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:38,845 INFO L225 Difference]: With dead ends: 25186 [2021-12-17 21:05:38,846 INFO L226 Difference]: Without dead ends: 15686 [2021-12-17 21:05:38,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:05:38,859 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 105 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:38,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 682 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 21:05:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15686 states. [2021-12-17 21:05:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15686 to 15592. [2021-12-17 21:05:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15592 states, 13292 states have (on average 1.1205236232320193) internal successors, (14894), 13456 states have internal predecessors, (14894), 1183 states have call successors, (1183), 910 states have call predecessors, (1183), 1115 states have return successors, (1857), 1227 states have call predecessors, (1857), 1180 states have call successors, (1857) [2021-12-17 21:05:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15592 states to 15592 states and 17934 transitions. [2021-12-17 21:05:39,681 INFO L78 Accepts]: Start accepts. Automaton has 15592 states and 17934 transitions. Word has length 201 [2021-12-17 21:05:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:39,682 INFO L470 AbstractCegarLoop]: Abstraction has 15592 states and 17934 transitions. [2021-12-17 21:05:39,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-12-17 21:05:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15592 states and 17934 transitions. [2021-12-17 21:05:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-12-17 21:05:39,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:39,688 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:39,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-17 21:05:39,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:05:39,904 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2021-12-17 21:05:39,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:39,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189539655] [2021-12-17 21:05:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:39,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 21:05:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 21:05:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:05:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-17 21:05:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-17 21:05:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-17 21:05:40,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:40,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189539655] [2021-12-17 21:05:40,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189539655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:40,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:05:40,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 21:05:40,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430190715] [2021-12-17 21:05:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:40,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 21:05:40,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 21:05:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 21:05:40,031 INFO L87 Difference]: Start difference. First operand 15592 states and 17934 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:05:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:42,063 INFO L93 Difference]: Finished difference Result 33868 states and 38776 transitions. [2021-12-17 21:05:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 21:05:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2021-12-17 21:05:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:42,106 INFO L225 Difference]: With dead ends: 33868 [2021-12-17 21:05:42,106 INFO L226 Difference]: Without dead ends: 22894 [2021-12-17 21:05:42,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-17 21:05:42,127 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 1169 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:42,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1216 Valid, 1457 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 21:05:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22894 states. [2021-12-17 21:05:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22894 to 19485. [2021-12-17 21:05:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 16611 states have (on average 1.1101077599181266) internal successors, (18440), 16842 states have internal predecessors, (18440), 1456 states have call successors, (1456), 1108 states have call predecessors, (1456), 1416 states have return successors, (2296), 1536 states have call predecessors, (2296), 1453 states have call successors, (2296) [2021-12-17 21:05:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 22192 transitions. [2021-12-17 21:05:43,201 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 22192 transitions. Word has length 203 [2021-12-17 21:05:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:43,202 INFO L470 AbstractCegarLoop]: Abstraction has 19485 states and 22192 transitions. [2021-12-17 21:05:43,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-17 21:05:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 22192 transitions. [2021-12-17 21:05:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-12-17 21:05:43,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:43,208 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:43,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-17 21:05:43,209 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2021-12-17 21:05:43,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:43,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931947363] [2021-12-17 21:05:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:43,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 21:05:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 21:05:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 21:05:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 21:05:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-17 21:05:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 21:05:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-17 21:05:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 21:05:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-17 21:05:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 21:05:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-17 21:05:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:05:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-12-17 21:05:43,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:05:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931947363] [2021-12-17 21:05:43,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931947363] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:05:43,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:05:43,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 21:05:43,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860989678] [2021-12-17 21:05:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:05:43,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 21:05:43,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:05:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 21:05:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 21:05:43,264 INFO L87 Difference]: Start difference. First operand 19485 states and 22192 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 21:05:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 21:05:44,743 INFO L93 Difference]: Finished difference Result 30987 states and 36224 transitions. [2021-12-17 21:05:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 21:05:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2021-12-17 21:05:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 21:05:44,791 INFO L225 Difference]: With dead ends: 30987 [2021-12-17 21:05:44,791 INFO L226 Difference]: Without dead ends: 22202 [2021-12-17 21:05:44,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 21:05:44,810 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 303 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 21:05:44,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 900 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 21:05:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22202 states. [2021-12-17 21:05:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22202 to 19489. [2021-12-17 21:05:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19489 states, 16615 states have (on average 1.1100812518808305) internal successors, (18444), 16846 states have internal predecessors, (18444), 1456 states have call successors, (1456), 1108 states have call predecessors, (1456), 1416 states have return successors, (2296), 1536 states have call predecessors, (2296), 1453 states have call successors, (2296) [2021-12-17 21:05:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19489 states to 19489 states and 22196 transitions. [2021-12-17 21:05:45,935 INFO L78 Accepts]: Start accepts. Automaton has 19489 states and 22196 transitions. Word has length 207 [2021-12-17 21:05:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 21:05:45,936 INFO L470 AbstractCegarLoop]: Abstraction has 19489 states and 22196 transitions. [2021-12-17 21:05:45,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 21:05:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19489 states and 22196 transitions. [2021-12-17 21:05:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-17 21:05:45,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 21:05:45,944 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:45,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-17 21:05:45,959 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 21:05:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:05:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2021-12-17 21:05:45,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:05:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547008842] [2021-12-17 21:05:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:05:45,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:05:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:05:45,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 21:05:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 21:05:46,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 21:05:46,067 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 21:05:46,067 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 21:05:46,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 21:05:46,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-17 21:05:46,071 INFO L732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:05:46,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 21:05:46,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 09:05:46 BoogieIcfgContainer [2021-12-17 21:05:46,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 21:05:46,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 21:05:46,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 21:05:46,181 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 21:05:46,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:04:37" (3/4) ... [2021-12-17 21:05:46,183 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 21:05:46,268 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 21:05:46,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 21:05:46,269 INFO L158 Benchmark]: Toolchain (without parser) took 70092.33ms. Allocated memory was 119.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 93.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2021-12-17 21:05:46,269 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.72ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 88.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.43ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 85.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,269 INFO L158 Benchmark]: Boogie Preprocessor took 50.21ms. Allocated memory is still 119.5MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,270 INFO L158 Benchmark]: RCFGBuilder took 611.56ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 58.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,270 INFO L158 Benchmark]: TraceAbstraction took 69000.51ms. Allocated memory was 119.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 57.3MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-12-17 21:05:46,270 INFO L158 Benchmark]: Witness Printer took 87.41ms. Allocated memory is still 4.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-17 21:05:46,271 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.23ms. Allocated memory is still 90.2MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.72ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 88.4MB in the end (delta: 4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.43ms. Allocated memory is still 119.5MB. Free memory was 88.4MB in the beginning and 85.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.21ms. Allocated memory is still 119.5MB. Free memory was 85.4MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.56ms. Allocated memory is still 119.5MB. Free memory was 83.2MB in the beginning and 58.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 69000.51ms. Allocated memory was 119.5MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 57.3MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 87.41ms. Allocated memory is still 4.2GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. 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 t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] 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_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] 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_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] 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_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_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=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] 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_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] 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_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, token=2] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, token=2] [L772] tmp = exists_runnable_thread2() [L774] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] 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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [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_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - 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, 241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 68.8s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21926 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21430 mSDsluCounter, 40042 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24620 mSDsCounter, 4382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16456 IncrementalHoareTripleChecker+Invalid, 20838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4382 mSolverCounterUnsat, 15422 mSDtfsCounter, 16456 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4424 GetRequests, 3938 SyntacticMatches, 12 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23842occurred in iteration=33, InterpolantAutomatonStates: 402, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 16487 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 8344 NumberOfCodeBlocks, 8344 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8146 ConstructedInterpolants, 0 QuantifiedInterpolants, 15095 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10191 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 64 InterpolantComputations, 43 PerfectInterpolantSequences, 3836/4182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 21:05:46,300 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