./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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_3.cil+token_ring.01.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:14:33,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:14:33,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:14:34,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:14:34,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:14:34,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:14:34,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:14:34,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:14:34,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:14:34,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:14:34,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:14:34,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:14:34,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:14:34,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:14:34,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:14:34,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:14:34,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:14:34,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:14:34,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:14:34,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:14:34,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:14:34,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:14:34,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:14:34,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:14:34,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:14:34,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:14:34,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:14:34,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:14:34,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:14:34,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:14:34,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:14:34,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:14:34,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:14:34,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:14:34,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:14:34,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:14:34,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:14:34,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:14:34,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:14:34,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:14:34,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:14:34,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:14:34,112 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:14:34,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:14:34,113 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:14:34,113 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:14:34,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:14:34,114 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:14:34,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:14:34,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:14:34,115 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:14:34,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:14:34,116 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:14:34,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:14:34,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:14:34,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:14:34,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:14:34,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:14:34,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:14:34,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:14:34,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:14:34,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:34,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:14:34,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:14:34,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:14:34,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:14:34,120 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2021-12-22 13:14:34,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:14:34,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:14:34,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:14:34,348 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:14:34,349 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:14:34,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-22 13:14:34,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c217257c1/ec89cc54505e49929e78f13921087e4e/FLAG4e0445709 [2021-12-22 13:14:34,764 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:14:34,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-22 13:14:34,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c217257c1/ec89cc54505e49929e78f13921087e4e/FLAG4e0445709 [2021-12-22 13:14:34,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c217257c1/ec89cc54505e49929e78f13921087e4e [2021-12-22 13:14:34,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:14:34,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:14:34,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:34,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:14:34,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:14:34,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:34" (1/1) ... [2021-12-22 13:14:34,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4bd475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:34, skipping insertion in model container [2021-12-22 13:14:34,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:34" (1/1) ... [2021-12-22 13:14:34,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:14:34,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:14:34,987 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_3.cil+token_ring.01.cil-2.c[911,924] [2021-12-22 13:14:35,057 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_3.cil+token_ring.01.cil-2.c[8416,8429] [2021-12-22 13:14:35,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:35,092 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:14:35,102 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_3.cil+token_ring.01.cil-2.c[911,924] [2021-12-22 13:14:35,131 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_3.cil+token_ring.01.cil-2.c[8416,8429] [2021-12-22 13:14:35,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:35,174 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:14:35,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35 WrapperNode [2021-12-22 13:14:35,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:35,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:35,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:14:35,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:14:35,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,232 INFO L137 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2021-12-22 13:14:35,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:35,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:14:35,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:14:35,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:14:35,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:14:35,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:14:35,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:14:35,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:14:35,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (1/1) ... [2021-12-22 13:14:35,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:35,299 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-22 13:14:35,315 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-22 13:14:35,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:14:35,341 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-22 13:14:35,342 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-22 13:14:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 13:14:35,343 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 13:14:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-22 13:14:35,343 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-22 13:14:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-22 13:14:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-22 13:14:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-22 13:14:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-22 13:14:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-22 13:14:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-22 13:14:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-22 13:14:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-22 13:14:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-22 13:14:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-22 13:14:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 13:14:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 13:14:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-22 13:14:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-22 13:14:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-22 13:14:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-22 13:14:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:14:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-22 13:14:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-22 13:14:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-22 13:14:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-22 13:14:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:14:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:14:35,347 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-22 13:14:35,347 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-22 13:14:35,347 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2021-12-22 13:14:35,347 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2021-12-22 13:14:35,416 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:14:35,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:14:35,792 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-12-22 13:14:35,793 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-12-22 13:14:35,830 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:14:35,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:14:35,851 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-22 13:14:35,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:35 BoogieIcfgContainer [2021-12-22 13:14:35,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:14:35,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:14:35,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:14:35,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:14:35,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:14:34" (1/3) ... [2021-12-22 13:14:35,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372ae5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:35, skipping insertion in model container [2021-12-22 13:14:35,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:35" (2/3) ... [2021-12-22 13:14:35,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372ae5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:35, skipping insertion in model container [2021-12-22 13:14:35,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:35" (3/3) ... [2021-12-22 13:14:35,859 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2021-12-22 13:14:35,863 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:14:35,863 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:14:35,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:14:35,915 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-22 13:14:35,916 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 13:14:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-22 13:14:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:14:35,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:35,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:35,947 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2021-12-22 13:14:35,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:35,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597448498] [2021-12-22 13:14:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:35,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:36,229 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-22 13:14:36,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:36,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597448498] [2021-12-22 13:14:36,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597448498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:36,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:36,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:14:36,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866107043] [2021-12-22 13:14:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:36,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:14:36,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:14:36,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:14:36,263 INFO L87 Difference]: Start difference. First operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:36,927 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2021-12-22 13:14:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:14:36,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 13:14:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:36,944 INFO L225 Difference]: With dead ends: 584 [2021-12-22 13:14:36,944 INFO L226 Difference]: Without dead ends: 359 [2021-12-22 13:14:36,950 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-22 13:14:36,952 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 572 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:36,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 891 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:14:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-22 13:14:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2021-12-22 13:14:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2021-12-22 13:14:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2021-12-22 13:14:37,031 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2021-12-22 13:14:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:37,032 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2021-12-22 13:14:37,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2021-12-22 13:14:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:14:37,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:37,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:37,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:14:37,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:37,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2021-12-22 13:14:37,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:37,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425085619] [2021-12-22 13:14:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:37,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,163 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-22 13:14:37,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:37,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425085619] [2021-12-22 13:14:37,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425085619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:37,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:37,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:14:37,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620371640] [2021-12-22 13:14:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:37,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:14:37,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:14:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:37,168 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:37,761 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2021-12-22 13:14:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:14:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 13:14:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:37,764 INFO L225 Difference]: With dead ends: 667 [2021-12-22 13:14:37,764 INFO L226 Difference]: Without dead ends: 472 [2021-12-22 13:14:37,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:14:37,770 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 547 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:37,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1246 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:14:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-12-22 13:14:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2021-12-22 13:14:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-22 13:14:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2021-12-22 13:14:37,804 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2021-12-22 13:14:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:37,804 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2021-12-22 13:14:37,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2021-12-22 13:14:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:14:37,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:37,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:37,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:14:37,807 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2021-12-22 13:14:37,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:37,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467211769] [2021-12-22 13:14:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:37,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:37,908 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-22 13:14:37,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467211769] [2021-12-22 13:14:37,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467211769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:37,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:37,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:14:37,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637365427] [2021-12-22 13:14:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:37,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:14:37,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:14:37,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:37,911 INFO L87 Difference]: Start difference. First operand 406 states and 579 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:38,225 INFO L93 Difference]: Finished difference Result 753 states and 1087 transitions. [2021-12-22 13:14:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:14:38,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 13:14:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:38,228 INFO L225 Difference]: With dead ends: 753 [2021-12-22 13:14:38,228 INFO L226 Difference]: Without dead ends: 468 [2021-12-22 13:14:38,229 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-22 13:14:38,230 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 585 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:38,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 687 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:14:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-22 13:14:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 406. [2021-12-22 13:14:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-22 13:14:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2021-12-22 13:14:38,244 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 58 [2021-12-22 13:14:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:38,245 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2021-12-22 13:14:38,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2021-12-22 13:14:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:14:38,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:38,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:38,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:14:38,246 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2021-12-22 13:14:38,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:38,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114433872] [2021-12-22 13:14:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:38,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,319 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-22 13:14:38,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114433872] [2021-12-22 13:14:38,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114433872] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:38,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:38,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:14:38,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796333816] [2021-12-22 13:14:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:38,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:14:38,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:14:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:38,329 INFO L87 Difference]: Start difference. First operand 406 states and 576 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:38,782 INFO L93 Difference]: Finished difference Result 789 states and 1144 transitions. [2021-12-22 13:14:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:14:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 13:14:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:38,784 INFO L225 Difference]: With dead ends: 789 [2021-12-22 13:14:38,785 INFO L226 Difference]: Without dead ends: 505 [2021-12-22 13:14:38,785 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-22 13:14:38,786 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 285 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:38,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 1196 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:14:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-22 13:14:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2021-12-22 13:14:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2021-12-22 13:14:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2021-12-22 13:14:38,805 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 58 [2021-12-22 13:14:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:38,805 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2021-12-22 13:14:38,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2021-12-22 13:14:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-22 13:14:38,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:38,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:38,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:14:38,807 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2021-12-22 13:14:38,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666904446] [2021-12-22 13:14:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:38,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:38,895 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-22 13:14:38,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:38,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666904446] [2021-12-22 13:14:38,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666904446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:38,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:38,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:14:38,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954992229] [2021-12-22 13:14:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:38,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:14:38,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:14:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:38,899 INFO L87 Difference]: Start difference. First operand 415 states and 585 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:39,694 INFO L93 Difference]: Finished difference Result 1587 states and 2310 transitions. [2021-12-22 13:14:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 13:14:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-22 13:14:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:39,700 INFO L225 Difference]: With dead ends: 1587 [2021-12-22 13:14:39,701 INFO L226 Difference]: Without dead ends: 1294 [2021-12-22 13:14:39,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-22 13:14:39,705 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 1080 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:39,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 1079 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 13:14:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-12-22 13:14:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1123. [2021-12-22 13:14:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2021-12-22 13:14:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1569 transitions. [2021-12-22 13:14:39,769 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1569 transitions. Word has length 58 [2021-12-22 13:14:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:39,771 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1569 transitions. [2021-12-22 13:14:39,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-22 13:14:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1569 transitions. [2021-12-22 13:14:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:14:39,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:39,772 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-22 13:14:39,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:14:39,772 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2021-12-22 13:14:39,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:39,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091429143] [2021-12-22 13:14:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:39,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:39,851 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-22 13:14:39,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:39,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091429143] [2021-12-22 13:14:39,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091429143] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:39,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:39,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:39,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480641952] [2021-12-22 13:14:39,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:39,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:39,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:39,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:39,853 INFO L87 Difference]: Start difference. First operand 1123 states and 1569 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-22 13:14:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:40,373 INFO L93 Difference]: Finished difference Result 1378 states and 1939 transitions. [2021-12-22 13:14:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:14:40,374 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-22 13:14:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:40,378 INFO L225 Difference]: With dead ends: 1378 [2021-12-22 13:14:40,378 INFO L226 Difference]: Without dead ends: 1274 [2021-12-22 13:14:40,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:14:40,380 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 619 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:40,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 1093 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2021-12-22 13:14:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1235. [2021-12-22 13:14:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2021-12-22 13:14:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1727 transitions. [2021-12-22 13:14:40,430 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1727 transitions. Word has length 65 [2021-12-22 13:14:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:40,431 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1727 transitions. [2021-12-22 13:14:40,431 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-22 13:14:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1727 transitions. [2021-12-22 13:14:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:14:40,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:40,432 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-22 13:14:40,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:14:40,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2021-12-22 13:14:40,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:40,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547172314] [2021-12-22 13:14:40,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:40,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:40,497 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-22 13:14:40,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:40,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547172314] [2021-12-22 13:14:40,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547172314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:40,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:40,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:40,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552383755] [2021-12-22 13:14:40,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:40,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:40,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:40,499 INFO L87 Difference]: Start difference. First operand 1235 states and 1727 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-22 13:14:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:41,135 INFO L93 Difference]: Finished difference Result 1632 states and 2293 transitions. [2021-12-22 13:14:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:14:41,135 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-22 13:14:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:41,141 INFO L225 Difference]: With dead ends: 1632 [2021-12-22 13:14:41,141 INFO L226 Difference]: Without dead ends: 1423 [2021-12-22 13:14:41,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:14:41,142 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 617 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:41,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 1272 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:14:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2021-12-22 13:14:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1347. [2021-12-22 13:14:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2021-12-22 13:14:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1887 transitions. [2021-12-22 13:14:41,201 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1887 transitions. Word has length 65 [2021-12-22 13:14:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:41,202 INFO L470 AbstractCegarLoop]: Abstraction has 1347 states and 1887 transitions. [2021-12-22 13:14:41,202 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-22 13:14:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1887 transitions. [2021-12-22 13:14:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 13:14:41,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:41,205 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-22 13:14:41,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:14:41,205 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2021-12-22 13:14:41,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:41,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343728483] [2021-12-22 13:14:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:41,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:41,280 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-22 13:14:41,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343728483] [2021-12-22 13:14:41,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343728483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:41,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:41,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:14:41,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536669125] [2021-12-22 13:14:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:41,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:14:41,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:14:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:41,282 INFO L87 Difference]: Start difference. First operand 1347 states and 1887 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-22 13:14:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:42,578 INFO L93 Difference]: Finished difference Result 2893 states and 4085 transitions. [2021-12-22 13:14:42,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 13:14:42,579 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2021-12-22 13:14:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:42,588 INFO L225 Difference]: With dead ends: 2893 [2021-12-22 13:14:42,588 INFO L226 Difference]: Without dead ends: 2560 [2021-12-22 13:14:42,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-22 13:14:42,591 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1940 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:42,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1962 Valid, 1839 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-22 13:14:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2021-12-22 13:14:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2400. [2021-12-22 13:14:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2021-12-22 13:14:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3274 transitions. [2021-12-22 13:14:42,709 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3274 transitions. Word has length 65 [2021-12-22 13:14:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:42,710 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 3274 transitions. [2021-12-22 13:14:42,710 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-22 13:14:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3274 transitions. [2021-12-22 13:14:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-22 13:14:42,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:42,712 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-22 13:14:42,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:14:42,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2021-12-22 13:14:42,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:42,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108668707] [2021-12-22 13:14:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:42,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:14:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 13:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:42,795 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-22 13:14:42,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108668707] [2021-12-22 13:14:42,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108668707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:42,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:42,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:42,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619797314] [2021-12-22 13:14:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:42,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:42,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:42,797 INFO L87 Difference]: Start difference. First operand 2400 states and 3274 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-22 13:14:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:43,326 INFO L93 Difference]: Finished difference Result 3928 states and 5353 transitions. [2021-12-22 13:14:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:14:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2021-12-22 13:14:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:43,337 INFO L225 Difference]: With dead ends: 3928 [2021-12-22 13:14:43,337 INFO L226 Difference]: Without dead ends: 2548 [2021-12-22 13:14:43,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:14:43,342 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 227 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:43,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1549 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2021-12-22 13:14:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2440. [2021-12-22 13:14:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2021-12-22 13:14:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3308 transitions. [2021-12-22 13:14:43,439 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3308 transitions. Word has length 66 [2021-12-22 13:14:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:43,440 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 3308 transitions. [2021-12-22 13:14:43,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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-22 13:14:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3308 transitions. [2021-12-22 13:14:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-22 13:14:43,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:43,441 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-22 13:14:43,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:14:43,442 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2021-12-22 13:14:43,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614948511] [2021-12-22 13:14:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:43,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:14:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 13:14:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:43,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-22 13:14:43,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:43,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614948511] [2021-12-22 13:14:43,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614948511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:43,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:43,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:14:43,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135313748] [2021-12-22 13:14:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:43,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:14:43,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:43,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:14:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:43,522 INFO L87 Difference]: Start difference. First operand 2440 states and 3308 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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-22 13:14:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:44,998 INFO L93 Difference]: Finished difference Result 6012 states and 8182 transitions. [2021-12-22 13:14:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 13:14:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2021-12-22 13:14:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:45,012 INFO L225 Difference]: With dead ends: 6012 [2021-12-22 13:14:45,013 INFO L226 Difference]: Without dead ends: 2831 [2021-12-22 13:14:45,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-22 13:14:45,022 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 2007 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:45,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2029 Valid, 1879 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-22 13:14:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2021-12-22 13:14:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2651. [2021-12-22 13:14:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2093 states have (on average 1.3325370281892022) internal successors, (2789), 2136 states have internal predecessors, (2789), 316 states have call successors, (316), 206 states have call predecessors, (316), 240 states have return successors, (415), 312 states have call predecessors, (415), 312 states have call successors, (415) [2021-12-22 13:14:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3520 transitions. [2021-12-22 13:14:45,172 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3520 transitions. Word has length 66 [2021-12-22 13:14:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:45,172 INFO L470 AbstractCegarLoop]: Abstraction has 2651 states and 3520 transitions. [2021-12-22 13:14:45,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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-22 13:14:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3520 transitions. [2021-12-22 13:14:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-22 13:14:45,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:45,175 INFO L514 BasicCegarLoop]: trace histogram [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-22 13:14:45,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:14:45,176 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 457439213, now seen corresponding path program 1 times [2021-12-22 13:14:45,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:45,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575590134] [2021-12-22 13:14:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:45,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-22 13:14:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 13:14:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-22 13:14:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 13:14:45,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575590134] [2021-12-22 13:14:45,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575590134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:45,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:45,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:45,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35154055] [2021-12-22 13:14:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:45,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:45,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:45,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:45,271 INFO L87 Difference]: Start difference. First operand 2651 states and 3520 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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-22 13:14:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:45,816 INFO L93 Difference]: Finished difference Result 4476 states and 5922 transitions. [2021-12-22 13:14:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:14:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2021-12-22 13:14:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:45,827 INFO L225 Difference]: With dead ends: 4476 [2021-12-22 13:14:45,827 INFO L226 Difference]: Without dead ends: 2845 [2021-12-22 13:14:45,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 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-22 13:14:45,831 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 219 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:45,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 1475 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2021-12-22 13:14:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2711. [2021-12-22 13:14:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3222793087342364) internal successors, (2831), 2184 states have internal predecessors, (2831), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2021-12-22 13:14:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3574 transitions. [2021-12-22 13:14:45,977 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3574 transitions. Word has length 91 [2021-12-22 13:14:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:45,977 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 3574 transitions. [2021-12-22 13:14:45,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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-22 13:14:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3574 transitions. [2021-12-22 13:14:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-22 13:14:45,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:45,980 INFO L514 BasicCegarLoop]: trace histogram [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-22 13:14:45,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:14:45,980 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 901339887, now seen corresponding path program 1 times [2021-12-22 13:14:45,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:45,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538506264] [2021-12-22 13:14:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:45,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-22 13:14:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 13:14:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-22 13:14:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 13:14:46,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:46,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538506264] [2021-12-22 13:14:46,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538506264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:46,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:46,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:14:46,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497614227] [2021-12-22 13:14:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:46,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:14:46,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:14:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:46,054 INFO L87 Difference]: Start difference. First operand 2711 states and 3574 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 13:14:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:46,436 INFO L93 Difference]: Finished difference Result 6308 states and 8282 transitions. [2021-12-22 13:14:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:14:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2021-12-22 13:14:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:46,453 INFO L225 Difference]: With dead ends: 6308 [2021-12-22 13:14:46,454 INFO L226 Difference]: Without dead ends: 4618 [2021-12-22 13:14:46,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-22 13:14:46,459 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 784 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:46,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 711 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:14:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4618 states. [2021-12-22 13:14:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4618 to 4398. [2021-12-22 13:14:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 3455 states have (on average 1.2931982633863965) internal successors, (4468), 3532 states have internal predecessors, (4468), 505 states have call successors, (505), 338 states have call predecessors, (505), 436 states have return successors, (759), 533 states have call predecessors, (759), 501 states have call successors, (759) [2021-12-22 13:14:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 5732 transitions. [2021-12-22 13:14:46,661 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 5732 transitions. Word has length 91 [2021-12-22 13:14:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:46,662 INFO L470 AbstractCegarLoop]: Abstraction has 4398 states and 5732 transitions. [2021-12-22 13:14:46,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-22 13:14:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 5732 transitions. [2021-12-22 13:14:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-22 13:14:46,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:46,664 INFO L514 BasicCegarLoop]: trace histogram [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-22 13:14:46,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:14:46,665 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:46,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash -156498191, now seen corresponding path program 1 times [2021-12-22 13:14:46,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:46,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691835290] [2021-12-22 13:14:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:46,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-22 13:14:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 13:14:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-22 13:14:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-22 13:14:46,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:46,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691835290] [2021-12-22 13:14:46,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691835290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:46,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:46,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:14:46,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196857096] [2021-12-22 13:14:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:46,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:14:46,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:14:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:14:46,718 INFO L87 Difference]: Start difference. First operand 4398 states and 5732 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-22 13:14:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:46,991 INFO L93 Difference]: Finished difference Result 6206 states and 8000 transitions. [2021-12-22 13:14:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 13:14:46,991 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), 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 91 [2021-12-22 13:14:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:47,003 INFO L225 Difference]: With dead ends: 6206 [2021-12-22 13:14:47,004 INFO L226 Difference]: Without dead ends: 2829 [2021-12-22 13:14:47,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:14:47,012 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 434 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:47,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 653 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:14:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2021-12-22 13:14:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2711. [2021-12-22 13:14:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2141 states have (on average 1.3021952358710882) internal successors, (2788), 2184 states have internal predecessors, (2788), 316 states have call successors, (316), 206 states have call predecessors, (316), 252 states have return successors, (427), 324 states have call predecessors, (427), 312 states have call successors, (427) [2021-12-22 13:14:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3531 transitions. [2021-12-22 13:14:47,189 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3531 transitions. Word has length 91 [2021-12-22 13:14:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:47,189 INFO L470 AbstractCegarLoop]: Abstraction has 2711 states and 3531 transitions. [2021-12-22 13:14:47,190 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), 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-22 13:14:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3531 transitions. [2021-12-22 13:14:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-22 13:14:47,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:47,192 INFO L514 BasicCegarLoop]: trace histogram [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-22 13:14:47,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:14:47,192 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 435090271, now seen corresponding path program 1 times [2021-12-22 13:14:47,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:47,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265272516] [2021-12-22 13:14:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:47,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-22 13:14:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 13:14:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 13:14:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:14:47,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:47,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265272516] [2021-12-22 13:14:47,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265272516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:47,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:47,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:47,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714805354] [2021-12-22 13:14:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:47,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:47,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:47,277 INFO L87 Difference]: Start difference. First operand 2711 states and 3531 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-22 13:14:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:48,252 INFO L93 Difference]: Finished difference Result 5520 states and 7110 transitions. [2021-12-22 13:14:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 13:14:48,252 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 92 [2021-12-22 13:14:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:48,277 INFO L225 Difference]: With dead ends: 5520 [2021-12-22 13:14:48,277 INFO L226 Difference]: Without dead ends: 3525 [2021-12-22 13:14:48,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-12-22 13:14:48,283 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 1228 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:48,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 1230 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 13:14:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2021-12-22 13:14:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3348. [2021-12-22 13:14:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2619 states have (on average 1.272241313478427) internal successors, (3332), 2671 states have internal predecessors, (3332), 395 states have call successors, (395), 255 states have call predecessors, (395), 332 states have return successors, (563), 425 states have call predecessors, (563), 391 states have call successors, (563) [2021-12-22 13:14:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4290 transitions. [2021-12-22 13:14:48,440 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4290 transitions. Word has length 92 [2021-12-22 13:14:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:48,442 INFO L470 AbstractCegarLoop]: Abstraction has 3348 states and 4290 transitions. [2021-12-22 13:14:48,442 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-22 13:14:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4290 transitions. [2021-12-22 13:14:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-22 13:14:48,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:48,444 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:48,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:14:48,445 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1866213314, now seen corresponding path program 1 times [2021-12-22 13:14:48,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:48,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680607889] [2021-12-22 13:14:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:48,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 13:14:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 13:14:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-22 13:14:48,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:48,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680607889] [2021-12-22 13:14:48,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680607889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:48,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357953491] [2021-12-22 13:14:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:48,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:48,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:48,541 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-22 13:14:48,546 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-22 13:14:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:48,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:14:48,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 13:14:48,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:48,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357953491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:48,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:48,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:14:48,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607548585] [2021-12-22 13:14:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:48,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:14:48,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:48,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:14:48,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:48,750 INFO L87 Difference]: Start difference. First operand 3348 states and 4290 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:48,874 INFO L93 Difference]: Finished difference Result 5241 states and 6949 transitions. [2021-12-22 13:14:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:14:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-22 13:14:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:48,891 INFO L225 Difference]: With dead ends: 5241 [2021-12-22 13:14:48,891 INFO L226 Difference]: Without dead ends: 3594 [2021-12-22 13:14:48,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:48,898 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 678 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-22 13:14:48,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 678 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2021-12-22 13:14:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2021-12-22 13:14:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2817 states have (on average 1.2765353212637558) internal successors, (3596), 2871 states have internal predecessors, (3596), 423 states have call successors, (423), 273 states have call predecessors, (423), 352 states have return successors, (605), 453 states have call predecessors, (605), 419 states have call successors, (605) [2021-12-22 13:14:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4624 transitions. [2021-12-22 13:14:49,045 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4624 transitions. Word has length 93 [2021-12-22 13:14:49,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:49,046 INFO L470 AbstractCegarLoop]: Abstraction has 3594 states and 4624 transitions. [2021-12-22 13:14:49,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4624 transitions. [2021-12-22 13:14:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-22 13:14:49,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:49,049 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:49,068 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-22 13:14:49,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-22 13:14:49,263 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -287830492, now seen corresponding path program 1 times [2021-12-22 13:14:49,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:49,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231133531] [2021-12-22 13:14:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:49,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-22 13:14:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-22 13:14:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-22 13:14:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-22 13:14:49,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231133531] [2021-12-22 13:14:49,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231133531] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:49,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962079992] [2021-12-22 13:14:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:49,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:49,338 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-22 13:14:49,339 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-22 13:14:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:49,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:14:49,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-22 13:14:49,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:49,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962079992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:49,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:49,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-22 13:14:49,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992263478] [2021-12-22 13:14:49,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:49,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:14:49,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:14:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:49,569 INFO L87 Difference]: Start difference. First operand 3594 states and 4624 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-22 13:14:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:49,721 INFO L93 Difference]: Finished difference Result 5345 states and 7099 transitions. [2021-12-22 13:14:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:14:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-22 13:14:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:49,731 INFO L225 Difference]: With dead ends: 5345 [2021-12-22 13:14:49,731 INFO L226 Difference]: Without dead ends: 4330 [2021-12-22 13:14:49,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:49,735 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 223 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 456 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-22 13:14:49,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 456 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-12-22 13:14:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4302. [2021-12-22 13:14:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 3390 states have (on average 1.2926253687315634) internal successors, (4382), 3453 states have internal predecessors, (4382), 501 states have call successors, (501), 324 states have call predecessors, (501), 409 states have return successors, (709), 528 states have call predecessors, (709), 497 states have call successors, (709) [2021-12-22 13:14:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5592 transitions. [2021-12-22 13:14:49,923 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5592 transitions. Word has length 119 [2021-12-22 13:14:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:49,923 INFO L470 AbstractCegarLoop]: Abstraction has 4302 states and 5592 transitions. [2021-12-22 13:14:49,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-22 13:14:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5592 transitions. [2021-12-22 13:14:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 13:14:49,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:49,927 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:49,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-22 13:14:50,143 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,SelfDestructingSolverStorable15 [2021-12-22 13:14:50,143 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1068470771, now seen corresponding path program 1 times [2021-12-22 13:14:50,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:50,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652778759] [2021-12-22 13:14:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:50,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 13:14:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:14:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 13:14:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 13:14:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-22 13:14:50,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652778759] [2021-12-22 13:14:50,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652778759] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:50,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740236183] [2021-12-22 13:14:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:50,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:50,244 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-22 13:14:50,245 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-22 13:14:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:50,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 13:14:50,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-22 13:14:50,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:50,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740236183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:50,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:50,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:14:50,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169509226] [2021-12-22 13:14:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:50,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:14:50,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:14:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:50,506 INFO L87 Difference]: Start difference. First operand 4302 states and 5592 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 13:14:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:50,674 INFO L93 Difference]: Finished difference Result 6564 states and 8764 transitions. [2021-12-22 13:14:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:14:50,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2021-12-22 13:14:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:50,686 INFO L225 Difference]: With dead ends: 6564 [2021-12-22 13:14:50,686 INFO L226 Difference]: Without dead ends: 4608 [2021-12-22 13:14:50,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:50,692 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 274 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 321 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-22 13:14:50,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 321 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2021-12-22 13:14:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4542. [2021-12-22 13:14:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4542 states, 3609 states have (on average 1.2618453865336658) internal successors, (4554), 3669 states have internal predecessors, (4554), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2021-12-22 13:14:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 5758 transitions. [2021-12-22 13:14:50,896 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 5758 transitions. Word has length 135 [2021-12-22 13:14:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:50,897 INFO L470 AbstractCegarLoop]: Abstraction has 4542 states and 5758 transitions. [2021-12-22 13:14:50,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-22 13:14:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 5758 transitions. [2021-12-22 13:14:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-22 13:14:50,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:50,901 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:50,919 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-22 13:14:51,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:51,119 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1809607182, now seen corresponding path program 1 times [2021-12-22 13:14:51,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:51,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938016602] [2021-12-22 13:14:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:51,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-22 13:14:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-22 13:14:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-22 13:14:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 13:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-22 13:14:51,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938016602] [2021-12-22 13:14:51,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938016602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058007559] [2021-12-22 13:14:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:51,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:51,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:51,180 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-22 13:14:51,181 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-22 13:14:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:51,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 13:14:51,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-22 13:14:51,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:51,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058007559] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:51,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:51,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:14:51,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633714604] [2021-12-22 13:14:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:51,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:14:51,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:51,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:14:51,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:51,467 INFO L87 Difference]: Start difference. First operand 4542 states and 5758 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-22 13:14:51,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:51,640 INFO L93 Difference]: Finished difference Result 6787 states and 8719 transitions. [2021-12-22 13:14:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:14:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2021-12-22 13:14:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:51,655 INFO L225 Difference]: With dead ends: 6787 [2021-12-22 13:14:51,655 INFO L226 Difference]: Without dead ends: 4593 [2021-12-22 13:14:51,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:51,662 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 262 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 444 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-22 13:14:51,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 444 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2021-12-22 13:14:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4524. [2021-12-22 13:14:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 3591 states have (on average 1.2481203007518797) internal successors, (4482), 3651 states have internal predecessors, (4482), 501 states have call successors, (501), 342 states have call predecessors, (501), 430 states have return successors, (703), 534 states have call predecessors, (703), 497 states have call successors, (703) [2021-12-22 13:14:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5686 transitions. [2021-12-22 13:14:51,855 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5686 transitions. Word has length 135 [2021-12-22 13:14:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:51,855 INFO L470 AbstractCegarLoop]: Abstraction has 4524 states and 5686 transitions. [2021-12-22 13:14:51,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-22 13:14:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5686 transitions. [2021-12-22 13:14:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-22 13:14:51,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:51,860 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:51,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 13:14:52,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-22 13:14:52,075 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1867127916, now seen corresponding path program 1 times [2021-12-22 13:14:52,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366173235] [2021-12-22 13:14:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:52,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-22 13:14:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-22 13:14:52,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:52,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366173235] [2021-12-22 13:14:52,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366173235] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:52,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735151595] [2021-12-22 13:14:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:52,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:52,156 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-22 13:14:52,157 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-22 13:14:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:52,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 13:14:52,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-22 13:14:52,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:52,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735151595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:52,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:52,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-22 13:14:52,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673426309] [2021-12-22 13:14:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:52,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:14:52,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:52,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:14:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:52,448 INFO L87 Difference]: Start difference. First operand 4524 states and 5686 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 13:14:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:52,583 INFO L93 Difference]: Finished difference Result 5468 states and 6974 transitions. [2021-12-22 13:14:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:14:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-22 13:14:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:52,595 INFO L225 Difference]: With dead ends: 5468 [2021-12-22 13:14:52,595 INFO L226 Difference]: Without dead ends: 4360 [2021-12-22 13:14:52,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:52,599 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 87 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 677 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-22 13:14:52,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 677 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2021-12-22 13:14:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4320. [2021-12-22 13:14:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4320 states, 3429 states have (on average 1.2379702537182853) internal successors, (4245), 3487 states have internal predecessors, (4245), 479 states have call successors, (479), 327 states have call predecessors, (479), 410 states have return successors, (663), 509 states have call predecessors, (663), 475 states have call successors, (663) [2021-12-22 13:14:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 4320 states and 5387 transitions. [2021-12-22 13:14:52,830 INFO L78 Accepts]: Start accepts. Automaton has 4320 states and 5387 transitions. Word has length 136 [2021-12-22 13:14:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:52,831 INFO L470 AbstractCegarLoop]: Abstraction has 4320 states and 5387 transitions. [2021-12-22 13:14:52,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-22 13:14:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4320 states and 5387 transitions. [2021-12-22 13:14:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:14:52,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:52,835 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:52,857 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-22 13:14:53,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:53,051 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -895196586, now seen corresponding path program 1 times [2021-12-22 13:14:53,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:53,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41954713] [2021-12-22 13:14:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:53,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:14:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-22 13:14:53,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41954713] [2021-12-22 13:14:53,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41954713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:53,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511508362] [2021-12-22 13:14:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:53,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:53,119 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-22 13:14:53,120 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-22 13:14:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:53,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 13:14:53,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-22 13:14:53,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:53,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511508362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:53,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:53,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 13:14:53,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005382953] [2021-12-22 13:14:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:53,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:14:53,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:14:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:53,444 INFO L87 Difference]: Start difference. First operand 4320 states and 5387 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:53,830 INFO L93 Difference]: Finished difference Result 5678 states and 7141 transitions. [2021-12-22 13:14:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 13:14:53,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 13:14:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:53,842 INFO L225 Difference]: With dead ends: 5678 [2021-12-22 13:14:53,842 INFO L226 Difference]: Without dead ends: 4313 [2021-12-22 13:14:53,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:14:53,846 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 330 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:53,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 533 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:14:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-12-22 13:14:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3744. [2021-12-22 13:14:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 2961 states have (on average 1.2228976697061804) internal successors, (3621), 3009 states have internal predecessors, (3621), 421 states have call successors, (421), 284 states have call predecessors, (421), 360 states have return successors, (571), 453 states have call predecessors, (571), 417 states have call successors, (571) [2021-12-22 13:14:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 4613 transitions. [2021-12-22 13:14:54,047 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 4613 transitions. Word has length 137 [2021-12-22 13:14:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:54,047 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 4613 transitions. [2021-12-22 13:14:54,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4613 transitions. [2021-12-22 13:14:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:14:54,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:54,050 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:54,083 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-22 13:14:54,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:54,263 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1533062036, now seen corresponding path program 1 times [2021-12-22 13:14:54,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:54,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45818407] [2021-12-22 13:14:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:54,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:14:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-22 13:14:54,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:54,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45818407] [2021-12-22 13:14:54,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45818407] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:54,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814071081] [2021-12-22 13:14:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:54,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:54,353 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-22 13:14:54,387 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-22 13:14:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:54,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 13:14:54,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-22 13:14:54,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:54,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814071081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:54,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:54,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-22 13:14:54,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670505967] [2021-12-22 13:14:54,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:54,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:14:54,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:54,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:14:54,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:54,628 INFO L87 Difference]: Start difference. First operand 3744 states and 4613 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:54,948 INFO L93 Difference]: Finished difference Result 4876 states and 6006 transitions. [2021-12-22 13:14:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:14:54,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 13:14:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:54,959 INFO L225 Difference]: With dead ends: 4876 [2021-12-22 13:14:54,960 INFO L226 Difference]: Without dead ends: 3480 [2021-12-22 13:14:54,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:14:54,964 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 351 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:54,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 543 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:14:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2021-12-22 13:14:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3458. [2021-12-22 13:14:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2733 states have (on average 1.2034394438346139) internal successors, (3289), 2777 states have internal predecessors, (3289), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2021-12-22 13:14:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4194 transitions. [2021-12-22 13:14:55,133 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4194 transitions. Word has length 137 [2021-12-22 13:14:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:55,133 INFO L470 AbstractCegarLoop]: Abstraction has 3458 states and 4194 transitions. [2021-12-22 13:14:55,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4194 transitions. [2021-12-22 13:14:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:14:55,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:55,136 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:55,157 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-22 13:14:55,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:55,352 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash 225919638, now seen corresponding path program 1 times [2021-12-22 13:14:55,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:55,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609490021] [2021-12-22 13:14:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:55,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:14:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-22 13:14:55,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609490021] [2021-12-22 13:14:55,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609490021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:14:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374313317] [2021-12-22 13:14:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:55,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:14:55,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:55,429 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-22 13:14:55,450 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-22 13:14:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:55,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 13:14:55,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:14:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-22 13:14:55,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:14:55,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374313317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:55,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:14:55,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-22 13:14:55,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632592963] [2021-12-22 13:14:55,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:55,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:14:55,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:14:55,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:14:55,693 INFO L87 Difference]: Start difference. First operand 3458 states and 4194 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:55,878 INFO L93 Difference]: Finished difference Result 4597 states and 5591 transitions. [2021-12-22 13:14:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:14:55,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-22 13:14:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:55,888 INFO L225 Difference]: With dead ends: 4597 [2021-12-22 13:14:55,888 INFO L226 Difference]: Without dead ends: 3486 [2021-12-22 13:14:55,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:55,893 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 10 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1151 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-22 13:14:55,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 13:14:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-12-22 13:14:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3470. [2021-12-22 13:14:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3470 states, 2745 states have (on average 1.1948998178506376) internal successors, (3280), 2789 states have internal predecessors, (3280), 383 states have call successors, (383), 262 states have call predecessors, (383), 340 states have return successors, (522), 421 states have call predecessors, (522), 379 states have call successors, (522) [2021-12-22 13:14:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4185 transitions. [2021-12-22 13:14:56,074 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4185 transitions. Word has length 137 [2021-12-22 13:14:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:56,074 INFO L470 AbstractCegarLoop]: Abstraction has 3470 states and 4185 transitions. [2021-12-22 13:14:56,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4185 transitions. [2021-12-22 13:14:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-22 13:14:56,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:56,077 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:56,097 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-22 13:14:56,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-22 13:14:56,291 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1775392230, now seen corresponding path program 1 times [2021-12-22 13:14:56,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:56,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407550898] [2021-12-22 13:14:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:56,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:14:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-22 13:14:56,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:56,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407550898] [2021-12-22 13:14:56,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407550898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:56,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:56,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:14:56,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753053419] [2021-12-22 13:14:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:56,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:14:56,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:14:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:14:56,389 INFO L87 Difference]: Start difference. First operand 3470 states and 4185 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-22 13:14:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:57,044 INFO L93 Difference]: Finished difference Result 4448 states and 5284 transitions. [2021-12-22 13:14:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:14:57,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-22 13:14:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:57,051 INFO L225 Difference]: With dead ends: 4448 [2021-12-22 13:14:57,051 INFO L226 Difference]: Without dead ends: 4445 [2021-12-22 13:14:57,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:14:57,053 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 727 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:57,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 861 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2021-12-22 13:14:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4174. [2021-12-22 13:14:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4174 states, 3325 states have (on average 1.1819548872180452) internal successors, (3930), 3375 states have internal predecessors, (3930), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2021-12-22 13:14:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 4982 transitions. [2021-12-22 13:14:57,305 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 4982 transitions. Word has length 137 [2021-12-22 13:14:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:57,306 INFO L470 AbstractCegarLoop]: Abstraction has 4174 states and 4982 transitions. [2021-12-22 13:14:57,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-22 13:14:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 4982 transitions. [2021-12-22 13:14:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-22 13:14:57,308 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:57,309 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:57,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 13:14:57,309 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1319300478, now seen corresponding path program 1 times [2021-12-22 13:14:57,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:57,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792588422] [2021-12-22 13:14:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:57,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-22 13:14:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 13:14:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:14:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 13:14:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:14:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:14:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-22 13:14:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-22 13:14:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-22 13:14:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-22 13:14:57,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792588422] [2021-12-22 13:14:57,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792588422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:57,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:57,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:14:57,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44700851] [2021-12-22 13:14:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:57,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:14:57,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:14:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:14:57,365 INFO L87 Difference]: Start difference. First operand 4174 states and 4982 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:57,817 INFO L93 Difference]: Finished difference Result 5929 states and 7136 transitions. [2021-12-22 13:14:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:14:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-22 13:14:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:57,825 INFO L225 Difference]: With dead ends: 5929 [2021-12-22 13:14:57,826 INFO L226 Difference]: Without dead ends: 4691 [2021-12-22 13:14:57,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:14:57,829 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 252 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:57,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 834 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:14:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2021-12-22 13:14:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4176. [2021-12-22 13:14:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3327 states have (on average 1.1818455064622784) internal successors, (3932), 3377 states have internal predecessors, (3932), 451 states have call successors, (451), 310 states have call predecessors, (451), 396 states have return successors, (601), 491 states have call predecessors, (601), 447 states have call successors, (601) [2021-12-22 13:14:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 4984 transitions. [2021-12-22 13:14:58,044 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 4984 transitions. Word has length 141 [2021-12-22 13:14:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:58,045 INFO L470 AbstractCegarLoop]: Abstraction has 4176 states and 4984 transitions. [2021-12-22 13:14:58,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-22 13:14:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 4984 transitions. [2021-12-22 13:14:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-22 13:14:58,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:58,048 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:58,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 13:14:58,048 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1014498838, now seen corresponding path program 1 times [2021-12-22 13:14:58,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515966445] [2021-12-22 13:14:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:58,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:58,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:14:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:58,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:14:58,123 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:14:58,124 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 13:14:58,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 13:14:58,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 13:14:58,127 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:58,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:14:58,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:14:58 BoogieIcfgContainer [2021-12-22 13:14:58,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:14:58,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:14:58,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:14:58,242 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:14:58,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:35" (3/4) ... [2021-12-22 13:14:58,244 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:14:58,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:14:58,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:14:58,334 INFO L158 Benchmark]: Toolchain (without parser) took 23543.31ms. Allocated memory was 109.1MB in the beginning and 780.1MB in the end (delta: 671.1MB). Free memory was 81.0MB in the beginning and 371.8MB in the end (delta: -290.8MB). Peak memory consumption was 379.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,334 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 66.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:14:58,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.26ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 80.6MB in the beginning and 113.3MB in the end (delta: -32.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,335 INFO L158 Benchmark]: Boogie Preprocessor took 23.96ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,335 INFO L158 Benchmark]: RCFGBuilder took 594.36ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 82.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,336 INFO L158 Benchmark]: TraceAbstraction took 22387.47ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 81.8MB in the beginning and 395.9MB in the end (delta: -314.1MB). Peak memory consumption was 323.6MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,337 INFO L158 Benchmark]: Witness Printer took 91.43ms. Allocated memory is still 780.1MB. Free memory was 395.9MB in the beginning and 371.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:58,343 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.17ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 66.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.26ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 80.6MB in the beginning and 113.3MB in the end (delta: -32.7MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 110.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.96ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 108.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.36ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 82.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22387.47ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 81.8MB in the beginning and 395.9MB in the end (delta: -314.1MB). Peak memory consumption was 323.6MB. Max. memory is 16.1GB. * Witness Printer took 91.43ms. Allocated memory is still 780.1MB. Free memory was 395.9MB in the beginning and 371.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1012] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L850] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1014] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1015] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L878] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1019] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L634] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L932] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L640] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L682] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L698] token += 1 [L699] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L932] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L715] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L700] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L701] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L792] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L804] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L626] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L653] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L662] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: 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, 232 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14091 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13773 mSDsluCounter, 23298 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15230 mSDsCounter, 3488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11388 IncrementalHoareTripleChecker+Invalid, 14876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3488 mSolverCounterUnsat, 8068 mSDtfsCounter, 11388 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1806 GetRequests, 1491 SyntacticMatches, 2 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4542occurred in iteration=17, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 3240 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3460 NumberOfCodeBlocks, 3460 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3286 ConstructedInterpolants, 0 QuantifiedInterpolants, 5747 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3510 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1282/1357 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-22 13:14:58,372 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