./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8 --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 a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:33:35,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:33:35,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:33:35,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:33:35,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:33:35,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:33:35,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:33:35,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:33:35,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:33:35,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:33:35,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:33:35,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:33:35,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:33:35,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:33:35,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:33:35,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:33:35,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:33:35,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:33:35,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:33:35,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:33:35,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:33:35,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:33:35,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:33:35,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:33:35,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:33:35,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:33:35,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:33:35,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:33:35,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:33:35,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:33:35,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:33:35,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:33:35,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:33:35,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:33:35,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:33:35,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:33:35,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:33:35,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:33:35,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:33:35,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:33:35,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:33:35,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:33:35,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:33:35,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:33:35,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:33:35,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:33:35,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:33:35,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:33:35,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:33:35,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:33:35,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:33:35,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:33:35,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:33:35,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:33:35,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:33:35,940 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:33:35,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:33:35,940 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:33:35,940 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8 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 -> a31ccbb50ed824a1b6eea67c3747e38f48ab93613ea1abf86baf8d129dc78945 [2022-12-13 18:33:36,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:33:36,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:33:36,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:33:36,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:33:36,156 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:33:36,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-12-13 18:33:38,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:33:38,915 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:33:38,915 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-12-13 18:33:38,923 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/data/4060c1567/b3150d3250db4b7e8ac489c61e4b6855/FLAG6270a6cee [2022-12-13 18:33:38,936 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/data/4060c1567/b3150d3250db4b7e8ac489c61e4b6855 [2022-12-13 18:33:38,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:33:38,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:33:38,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:33:38,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:33:38,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:33:38,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:33:38" (1/1) ... [2022-12-13 18:33:38,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abc89c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:38, skipping insertion in model container [2022-12-13 18:33:38,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:33:38" (1/1) ... [2022-12-13 18:33:38,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:33:39,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:33:39,119 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-12-13 18:33:39,154 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-12-13 18:33:39,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:33:39,194 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:33:39,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[914,927] [2022-12-13 18:33:39,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c[7115,7128] [2022-12-13 18:33:39,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:33:39,251 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:33:39,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39 WrapperNode [2022-12-13 18:33:39,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:33:39,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:33:39,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:33:39,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:33:39,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,288 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 523 [2022-12-13 18:33:39,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:33:39,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:33:39,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:33:39,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:33:39,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:33:39,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:33:39,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:33:39,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:33:39,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (1/1) ... [2022-12-13 18:33:39,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:33:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:33:39,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:33:39,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:33:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:33:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 18:33:39,377 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 18:33:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 18:33:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 18:33:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 18:33:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 18:33:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 18:33:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 18:33:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 18:33:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 18:33:39,379 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 18:33:39,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 18:33:39,379 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 18:33:39,379 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 18:33:39,379 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 18:33:39,379 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 18:33:39,379 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 18:33:39,380 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 18:33:39,380 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 18:33:39,380 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 18:33:39,380 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 18:33:39,380 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 18:33:39,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:33:39,380 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 18:33:39,380 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 18:33:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 18:33:39,381 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 18:33:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:33:39,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:33:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 18:33:39,381 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 18:33:39,381 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 18:33:39,381 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 18:33:39,457 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:33:39,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:33:39,893 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:33:39,902 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:33:39,902 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-12-13 18:33:39,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:33:39 BoogieIcfgContainer [2022-12-13 18:33:39,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:33:39,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:33:39,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:33:39,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:33:39,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:33:38" (1/3) ... [2022-12-13 18:33:39,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9d09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:33:39, skipping insertion in model container [2022-12-13 18:33:39,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:33:39" (2/3) ... [2022-12-13 18:33:39,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9d09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:33:39, skipping insertion in model container [2022-12-13 18:33:39,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:33:39" (3/3) ... [2022-12-13 18:33:39,913 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-12-13 18:33:39,929 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:33:39,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:33:39,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:33:39,991 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d832508, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:33:39,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 18:33:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 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) [2022-12-13 18:33:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:40,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:40,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:40,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 207768249, now seen corresponding path program 1 times [2022-12-13 18:33:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756292838] [2022-12-13 18:33:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:40,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756292838] [2022-12-13 18:33:40,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756292838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:40,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:40,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:33:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404255670] [2022-12-13 18:33:40,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:40,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:33:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:33:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:33:40,467 INFO L87 Difference]: Start difference. First operand has 266 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 223 states have internal predecessors, (340), 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 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:41,200 INFO L93 Difference]: Finished difference Result 647 states and 988 transitions. [2022-12-13 18:33:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:33:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 18:33:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:41,213 INFO L225 Difference]: With dead ends: 647 [2022-12-13 18:33:41,213 INFO L226 Difference]: Without dead ends: 390 [2022-12-13 18:33:41,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:33:41,221 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 681 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:41,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 963 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:33:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-12-13 18:33:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 351. [2022-12-13 18:33:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 283 states have (on average 1.459363957597173) internal successors, (413), 290 states have internal predecessors, (413), 44 states have call successors, (44), 22 states have call predecessors, (44), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-12-13 18:33:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 502 transitions. [2022-12-13 18:33:41,298 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 502 transitions. Word has length 65 [2022-12-13 18:33:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:41,299 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 502 transitions. [2022-12-13 18:33:41,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 502 transitions. [2022-12-13 18:33:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:41,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:41,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:33:41,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1886656889, now seen corresponding path program 1 times [2022-12-13 18:33:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:41,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321160990] [2022-12-13 18:33:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:41,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321160990] [2022-12-13 18:33:41,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321160990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:41,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:41,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:33:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372360581] [2022-12-13 18:33:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:41,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:33:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:33:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:33:41,492 INFO L87 Difference]: Start difference. First operand 351 states and 502 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:42,261 INFO L93 Difference]: Finished difference Result 698 states and 979 transitions. [2022-12-13 18:33:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:33:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 18:33:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:42,265 INFO L225 Difference]: With dead ends: 698 [2022-12-13 18:33:42,266 INFO L226 Difference]: Without dead ends: 521 [2022-12-13 18:33:42,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 18:33:42,268 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 703 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:42,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1378 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:33:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-12-13 18:33:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 447. [2022-12-13 18:33:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 359 states have (on average 1.4401114206128134) internal successors, (517), 368 states have internal predecessors, (517), 55 states have call successors, (55), 29 states have call predecessors, (55), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-12-13 18:33:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 636 transitions. [2022-12-13 18:33:42,314 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 636 transitions. Word has length 65 [2022-12-13 18:33:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:42,315 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 636 transitions. [2022-12-13 18:33:42,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 636 transitions. [2022-12-13 18:33:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:42,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:42,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:42,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:33:42,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -141929221, now seen corresponding path program 1 times [2022-12-13 18:33:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:42,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412770427] [2022-12-13 18:33:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:42,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412770427] [2022-12-13 18:33:42,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412770427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:42,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:42,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:33:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546170349] [2022-12-13 18:33:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:42,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:33:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:42,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:33:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:33:42,471 INFO L87 Difference]: Start difference. First operand 447 states and 636 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:43,087 INFO L93 Difference]: Finished difference Result 748 states and 1050 transitions. [2022-12-13 18:33:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:33:43,088 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-13 18:33:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:43,092 INFO L225 Difference]: With dead ends: 748 [2022-12-13 18:33:43,092 INFO L226 Difference]: Without dead ends: 481 [2022-12-13 18:33:43,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:33:43,095 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 298 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:43,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1506 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:33:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-12-13 18:33:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 452. [2022-12-13 18:33:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 363 states have (on average 1.4297520661157024) internal successors, (519), 372 states have internal predecessors, (519), 55 states have call successors, (55), 29 states have call predecessors, (55), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-12-13 18:33:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 639 transitions. [2022-12-13 18:33:43,117 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 639 transitions. Word has length 65 [2022-12-13 18:33:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:43,117 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 639 transitions. [2022-12-13 18:33:43,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 639 transitions. [2022-12-13 18:33:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:43,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:43,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:43,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:33:43,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1171288519, now seen corresponding path program 1 times [2022-12-13 18:33:43,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:43,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88223758] [2022-12-13 18:33:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:43,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88223758] [2022-12-13 18:33:43,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88223758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:43,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:43,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:33:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603373681] [2022-12-13 18:33:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:43,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:33:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:43,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:33:43,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:33:43,241 INFO L87 Difference]: Start difference. First operand 452 states and 639 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:43,850 INFO L93 Difference]: Finished difference Result 770 states and 1072 transitions. [2022-12-13 18:33:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:33:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-13 18:33:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:43,852 INFO L225 Difference]: With dead ends: 770 [2022-12-13 18:33:43,852 INFO L226 Difference]: Without dead ends: 498 [2022-12-13 18:33:43,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:33:43,854 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 441 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:43,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1341 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:33:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-12-13 18:33:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 467. [2022-12-13 18:33:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 375 states have (on average 1.416) internal successors, (531), 384 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-12-13 18:33:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-12-13 18:33:43,873 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 65 [2022-12-13 18:33:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:43,874 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-12-13 18:33:43,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-12-13 18:33:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:43,875 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:43,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:43,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:33:43,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash 214914875, now seen corresponding path program 1 times [2022-12-13 18:33:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:43,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331094649] [2022-12-13 18:33:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:43,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331094649] [2022-12-13 18:33:43,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331094649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:43,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:43,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:33:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080193139] [2022-12-13 18:33:43,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:43,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:33:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:33:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:33:44,000 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:44,744 INFO L93 Difference]: Finished difference Result 859 states and 1165 transitions. [2022-12-13 18:33:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:33:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 18:33:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:44,747 INFO L225 Difference]: With dead ends: 859 [2022-12-13 18:33:44,747 INFO L226 Difference]: Without dead ends: 574 [2022-12-13 18:33:44,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-12-13 18:33:44,748 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 892 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:44,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 984 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:33:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-12-13 18:33:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 479. [2022-12-13 18:33:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 385 states have (on average 1.405194805194805) internal successors, (541), 394 states have internal predecessors, (541), 56 states have call successors, (56), 30 states have call predecessors, (56), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-12-13 18:33:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 664 transitions. [2022-12-13 18:33:44,774 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 664 transitions. Word has length 65 [2022-12-13 18:33:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:44,774 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 664 transitions. [2022-12-13 18:33:44,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 664 transitions. [2022-12-13 18:33:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:33:44,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:44,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:44,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:33:44,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash 80901369, now seen corresponding path program 1 times [2022-12-13 18:33:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:44,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379863694] [2022-12-13 18:33:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:44,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379863694] [2022-12-13 18:33:44,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379863694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:44,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943886166] [2022-12-13 18:33:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:44,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:44,853 INFO L87 Difference]: Start difference. First operand 479 states and 664 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:45,313 INFO L93 Difference]: Finished difference Result 1121 states and 1511 transitions. [2022-12-13 18:33:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:33:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 18:33:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:45,317 INFO L225 Difference]: With dead ends: 1121 [2022-12-13 18:33:45,317 INFO L226 Difference]: Without dead ends: 825 [2022-12-13 18:33:45,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 18:33:45,319 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1060 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:45,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 599 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:33:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-12-13 18:33:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 769. [2022-12-13 18:33:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 609 states have (on average 1.3596059113300492) internal successors, (828), 625 states have internal predecessors, (828), 91 states have call successors, (91), 52 states have call predecessors, (91), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2022-12-13 18:33:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1043 transitions. [2022-12-13 18:33:45,369 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1043 transitions. Word has length 65 [2022-12-13 18:33:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:45,370 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 1043 transitions. [2022-12-13 18:33:45,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 18:33:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1043 transitions. [2022-12-13 18:33:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 18:33:45,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:45,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:45,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:33:45,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1103860140, now seen corresponding path program 1 times [2022-12-13 18:33:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:45,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461149568] [2022-12-13 18:33:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461149568] [2022-12-13 18:33:45,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461149568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:45,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:45,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:33:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165131102] [2022-12-13 18:33:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:33:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:33:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:33:45,439 INFO L87 Difference]: Start difference. First operand 769 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:45,908 INFO L93 Difference]: Finished difference Result 1972 states and 2614 transitions. [2022-12-13 18:33:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:33:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-12-13 18:33:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:45,918 INFO L225 Difference]: With dead ends: 1972 [2022-12-13 18:33:45,918 INFO L226 Difference]: Without dead ends: 1365 [2022-12-13 18:33:45,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:33:45,921 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 664 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:45,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 721 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:33:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-12-13 18:33:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1250. [2022-12-13 18:33:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 988 states have (on average 1.3248987854251013) internal successors, (1309), 1007 states have internal predecessors, (1309), 136 states have call successors, (136), 96 states have call predecessors, (136), 124 states have return successors, (196), 153 states have call predecessors, (196), 132 states have call successors, (196) [2022-12-13 18:33:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1641 transitions. [2022-12-13 18:33:46,014 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1641 transitions. Word has length 66 [2022-12-13 18:33:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:46,014 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1641 transitions. [2022-12-13 18:33:46,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1641 transitions. [2022-12-13 18:33:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 18:33:46,017 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:46,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:46,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:33:46,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 354379519, now seen corresponding path program 1 times [2022-12-13 18:33:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:46,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404050686] [2022-12-13 18:33:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:46,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404050686] [2022-12-13 18:33:46,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404050686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:46,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:46,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:33:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410881167] [2022-12-13 18:33:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:46,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:33:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:33:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:33:46,091 INFO L87 Difference]: Start difference. First operand 1250 states and 1641 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:46,582 INFO L93 Difference]: Finished difference Result 3438 states and 4447 transitions. [2022-12-13 18:33:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:33:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-12-13 18:33:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:46,592 INFO L225 Difference]: With dead ends: 3438 [2022-12-13 18:33:46,592 INFO L226 Difference]: Without dead ends: 2370 [2022-12-13 18:33:46,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:33:46,594 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 882 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:46,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 599 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:33:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2022-12-13 18:33:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2112. [2022-12-13 18:33:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1654 states have (on average 1.2914147521160821) internal successors, (2136), 1683 states have internal predecessors, (2136), 234 states have call successors, (234), 180 states have call predecessors, (234), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2022-12-13 18:33:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2702 transitions. [2022-12-13 18:33:46,712 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2702 transitions. Word has length 66 [2022-12-13 18:33:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:46,712 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 2702 transitions. [2022-12-13 18:33:46,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2702 transitions. [2022-12-13 18:33:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 18:33:46,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:46,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:33:46,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1353227277, now seen corresponding path program 1 times [2022-12-13 18:33:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860971330] [2022-12-13 18:33:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:46,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860971330] [2022-12-13 18:33:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860971330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:46,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:46,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:33:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073584664] [2022-12-13 18:33:46,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:46,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:33:46,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:46,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:33:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:33:46,767 INFO L87 Difference]: Start difference. First operand 2112 states and 2702 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:47,230 INFO L93 Difference]: Finished difference Result 5022 states and 6352 transitions. [2022-12-13 18:33:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:33:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-12-13 18:33:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:47,239 INFO L225 Difference]: With dead ends: 5022 [2022-12-13 18:33:47,239 INFO L226 Difference]: Without dead ends: 3092 [2022-12-13 18:33:47,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:33:47,242 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 863 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:47,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 634 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:33:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2022-12-13 18:33:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2844. [2022-12-13 18:33:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2222 states have (on average 1.278127812781278) internal successors, (2840), 2259 states have internal predecessors, (2840), 314 states have call successors, (314), 250 states have call predecessors, (314), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2022-12-13 18:33:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3595 transitions. [2022-12-13 18:33:47,376 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3595 transitions. Word has length 72 [2022-12-13 18:33:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:47,376 INFO L495 AbstractCegarLoop]: Abstraction has 2844 states and 3595 transitions. [2022-12-13 18:33:47,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:33:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3595 transitions. [2022-12-13 18:33:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 18:33:47,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:47,378 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:47,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:33:47,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash 483330199, now seen corresponding path program 1 times [2022-12-13 18:33:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:47,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293124452] [2022-12-13 18:33:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293124452] [2022-12-13 18:33:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293124452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:47,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:47,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288622980] [2022-12-13 18:33:47,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:47,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:47,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:47,443 INFO L87 Difference]: Start difference. First operand 2844 states and 3595 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 18:33:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:48,023 INFO L93 Difference]: Finished difference Result 3618 states and 4526 transitions. [2022-12-13 18:33:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:33:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-12-13 18:33:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:48,035 INFO L225 Difference]: With dead ends: 3618 [2022-12-13 18:33:48,035 INFO L226 Difference]: Without dead ends: 3615 [2022-12-13 18:33:48,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-12-13 18:33:48,037 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 1239 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:48,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 610 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:33:48,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2022-12-13 18:33:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3338. [2022-12-13 18:33:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3338 states, 2607 states have (on average 1.2704257767548908) internal successors, (3312), 2649 states have internal predecessors, (3312), 364 states have call successors, (364), 294 states have call predecessors, (364), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2022-12-13 18:33:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 4196 transitions. [2022-12-13 18:33:48,192 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 4196 transitions. Word has length 73 [2022-12-13 18:33:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:48,193 INFO L495 AbstractCegarLoop]: Abstraction has 3338 states and 4196 transitions. [2022-12-13 18:33:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 18:33:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4196 transitions. [2022-12-13 18:33:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 18:33:48,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:48,194 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:48,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:33:48,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2097533117, now seen corresponding path program 1 times [2022-12-13 18:33:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:48,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167191603] [2022-12-13 18:33:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:48,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167191603] [2022-12-13 18:33:48,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167191603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:33:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961823791] [2022-12-13 18:33:48,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:33:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:33:48,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:33:48,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:33:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:48,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 18:33:48,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:33:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:48,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:33:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:48,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961823791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:33:48,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:33:48,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-12-13 18:33:48,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457917175] [2022-12-13 18:33:48,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:33:48,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:33:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:33:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:33:48,770 INFO L87 Difference]: Start difference. First operand 3338 states and 4196 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 18:33:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:50,305 INFO L93 Difference]: Finished difference Result 7779 states and 9682 transitions. [2022-12-13 18:33:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 18:33:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-12-13 18:33:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:50,334 INFO L225 Difference]: With dead ends: 7779 [2022-12-13 18:33:50,334 INFO L226 Difference]: Without dead ends: 7776 [2022-12-13 18:33:50,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-12-13 18:33:50,338 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1442 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:50,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1504 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:33:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2022-12-13 18:33:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 5128. [2022-12-13 18:33:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 4011 states have (on average 1.268511593118923) internal successors, (5088), 4075 states have internal predecessors, (5088), 548 states have call successors, (548), 452 states have call predecessors, (548), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2022-12-13 18:33:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 6434 transitions. [2022-12-13 18:33:50,762 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 6434 transitions. Word has length 74 [2022-12-13 18:33:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:50,762 INFO L495 AbstractCegarLoop]: Abstraction has 5128 states and 6434 transitions. [2022-12-13 18:33:50,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 18:33:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 6434 transitions. [2022-12-13 18:33:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 18:33:50,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:50,764 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:50,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:33:50,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 18:33:50,966 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -863953769, now seen corresponding path program 2 times [2022-12-13 18:33:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:50,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472228714] [2022-12-13 18:33:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:50,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:33:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:33:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:33:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:33:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:33:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:33:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:51,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472228714] [2022-12-13 18:33:51,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472228714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:51,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:51,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:33:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970714433] [2022-12-13 18:33:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:51,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:33:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:51,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:33:51,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:33:51,098 INFO L87 Difference]: Start difference. First operand 5128 states and 6434 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 18:33:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:51,681 INFO L93 Difference]: Finished difference Result 7810 states and 9807 transitions. [2022-12-13 18:33:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:33:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-12-13 18:33:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:51,690 INFO L225 Difference]: With dead ends: 7810 [2022-12-13 18:33:51,690 INFO L226 Difference]: Without dead ends: 3735 [2022-12-13 18:33:51,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:33:51,696 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 750 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:51,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 696 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:33:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-12-13 18:33:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3500. [2022-12-13 18:33:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2739 states have (on average 1.2515516611902153) internal successors, (3428), 2781 states have internal predecessors, (3428), 380 states have call successors, (380), 308 states have call predecessors, (380), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2022-12-13 18:33:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4332 transitions. [2022-12-13 18:33:51,892 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4332 transitions. Word has length 77 [2022-12-13 18:33:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 3500 states and 4332 transitions. [2022-12-13 18:33:51,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 18:33:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4332 transitions. [2022-12-13 18:33:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:51,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:51,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:33:51,894 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1029310995, now seen corresponding path program 1 times [2022-12-13 18:33:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214304355] [2022-12-13 18:33:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:51,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214304355] [2022-12-13 18:33:51,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214304355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:51,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:51,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:33:51,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117655894] [2022-12-13 18:33:51,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:51,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:33:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:51,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:33:51,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:33:51,969 INFO L87 Difference]: Start difference. First operand 3500 states and 4332 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:52,940 INFO L93 Difference]: Finished difference Result 3882 states and 4923 transitions. [2022-12-13 18:33:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:33:52,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-12-13 18:33:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:52,950 INFO L225 Difference]: With dead ends: 3882 [2022-12-13 18:33:52,950 INFO L226 Difference]: Without dead ends: 3734 [2022-12-13 18:33:52,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:33:52,952 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 760 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:52,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 806 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:33:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2022-12-13 18:33:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3647. [2022-12-13 18:33:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2867 states have (on average 1.264387861876526) internal successors, (3625), 2910 states have internal predecessors, (3625), 392 states have call successors, (392), 314 states have call predecessors, (392), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2022-12-13 18:33:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4556 transitions. [2022-12-13 18:33:53,216 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4556 transitions. Word has length 80 [2022-12-13 18:33:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:53,217 INFO L495 AbstractCegarLoop]: Abstraction has 3647 states and 4556 transitions. [2022-12-13 18:33:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4556 transitions. [2022-12-13 18:33:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:53,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:53,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:53,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:33:53,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:53,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -212129521, now seen corresponding path program 1 times [2022-12-13 18:33:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248470831] [2022-12-13 18:33:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:53,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248470831] [2022-12-13 18:33:53,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248470831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:53,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:53,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931176689] [2022-12-13 18:33:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:53,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:53,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:53,305 INFO L87 Difference]: Start difference. First operand 3647 states and 4556 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:54,633 INFO L93 Difference]: Finished difference Result 4220 states and 5436 transitions. [2022-12-13 18:33:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:33:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:33:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:54,644 INFO L225 Difference]: With dead ends: 4220 [2022-12-13 18:33:54,644 INFO L226 Difference]: Without dead ends: 3925 [2022-12-13 18:33:54,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:33:54,646 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 755 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:54,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1337 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:33:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2022-12-13 18:33:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3785. [2022-12-13 18:33:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 2986 states have (on average 1.2739450770261218) internal successors, (3804), 3030 states have internal predecessors, (3804), 404 states have call successors, (404), 320 states have call predecessors, (404), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2022-12-13 18:33:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 4761 transitions. [2022-12-13 18:33:54,947 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 4761 transitions. Word has length 80 [2022-12-13 18:33:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:54,947 INFO L495 AbstractCegarLoop]: Abstraction has 3785 states and 4761 transitions. [2022-12-13 18:33:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 4761 transitions. [2022-12-13 18:33:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:54,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:54,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:33:54,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1898309359, now seen corresponding path program 1 times [2022-12-13 18:33:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:54,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311170819] [2022-12-13 18:33:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311170819] [2022-12-13 18:33:55,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311170819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:55,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:55,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:55,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697723534] [2022-12-13 18:33:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:55,030 INFO L87 Difference]: Start difference. First operand 3785 states and 4761 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:56,246 INFO L93 Difference]: Finished difference Result 4717 states and 6189 transitions. [2022-12-13 18:33:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:33:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:33:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:56,257 INFO L225 Difference]: With dead ends: 4717 [2022-12-13 18:33:56,257 INFO L226 Difference]: Without dead ends: 4284 [2022-12-13 18:33:56,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:33:56,260 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 753 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:56,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1335 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:33:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-12-13 18:33:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4062. [2022-12-13 18:33:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2908527131782945) internal successors, (4163), 3271 states have internal predecessors, (4163), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-12-13 18:33:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5176 transitions. [2022-12-13 18:33:56,565 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5176 transitions. Word has length 80 [2022-12-13 18:33:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:56,565 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 5176 transitions. [2022-12-13 18:33:56,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5176 transitions. [2022-12-13 18:33:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:56,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:56,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:56,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:33:56,569 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1952702257, now seen corresponding path program 1 times [2022-12-13 18:33:56,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:56,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249737240] [2022-12-13 18:33:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:56,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:56,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249737240] [2022-12-13 18:33:56,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249737240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:56,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:56,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114710471] [2022-12-13 18:33:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:56,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:56,669 INFO L87 Difference]: Start difference. First operand 4062 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:57,486 INFO L93 Difference]: Finished difference Result 4982 states and 6595 transitions. [2022-12-13 18:33:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:33:57,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:33:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:57,498 INFO L225 Difference]: With dead ends: 4982 [2022-12-13 18:33:57,499 INFO L226 Difference]: Without dead ends: 4272 [2022-12-13 18:33:57,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:33:57,501 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 629 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:57,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 805 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:33:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2022-12-13 18:33:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4062. [2022-12-13 18:33:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2893023255813953) internal successors, (4158), 3271 states have internal predecessors, (4158), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-12-13 18:33:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5171 transitions. [2022-12-13 18:33:57,818 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5171 transitions. Word has length 80 [2022-12-13 18:33:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:57,819 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 5171 transitions. [2022-12-13 18:33:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5171 transitions. [2022-12-13 18:33:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:57,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:57,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:57,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:33:57,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1924868433, now seen corresponding path program 1 times [2022-12-13 18:33:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:57,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520786406] [2022-12-13 18:33:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520786406] [2022-12-13 18:33:57,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520786406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:57,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:57,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609945183] [2022-12-13 18:33:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:57,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:57,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:57,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:57,902 INFO L87 Difference]: Start difference. First operand 4062 states and 5171 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:33:58,883 INFO L93 Difference]: Finished difference Result 4976 states and 6569 transitions. [2022-12-13 18:33:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:33:58,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:33:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:33:58,892 INFO L225 Difference]: With dead ends: 4976 [2022-12-13 18:33:58,892 INFO L226 Difference]: Without dead ends: 4266 [2022-12-13 18:33:58,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:33:58,895 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 625 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:33:58,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 803 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:33:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2022-12-13 18:33:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4062. [2022-12-13 18:33:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3225 states have (on average 1.2877519379844962) internal successors, (4153), 3271 states have internal predecessors, (4153), 428 states have call successors, (428), 332 states have call predecessors, (428), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2022-12-13 18:33:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5166 transitions. [2022-12-13 18:33:59,272 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5166 transitions. Word has length 80 [2022-12-13 18:33:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:33:59,272 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 5166 transitions. [2022-12-13 18:33:59,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:33:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5166 transitions. [2022-12-13 18:33:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:33:59,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:33:59,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:33:59,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:33:59,280 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:33:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:33:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1690826609, now seen corresponding path program 1 times [2022-12-13 18:33:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:33:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968901619] [2022-12-13 18:33:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:33:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:33:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:33:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:33:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:33:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:33:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:33:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:33:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:33:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:33:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968901619] [2022-12-13 18:33:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968901619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:33:59,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:33:59,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:33:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279240484] [2022-12-13 18:33:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:33:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:33:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:33:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:33:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:33:59,366 INFO L87 Difference]: Start difference. First operand 4062 states and 5166 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:00,746 INFO L93 Difference]: Finished difference Result 5819 states and 7800 transitions. [2022-12-13 18:34:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 18:34:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:34:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:00,757 INFO L225 Difference]: With dead ends: 5819 [2022-12-13 18:34:00,757 INFO L226 Difference]: Without dead ends: 5109 [2022-12-13 18:34:00,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:34:00,760 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 877 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:00,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1002 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:34:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2022-12-13 18:34:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 4573. [2022-12-13 18:34:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3664 states have (on average 1.3081331877729259) internal successors, (4793), 3714 states have internal predecessors, (4793), 472 states have call successors, (472), 356 states have call predecessors, (472), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2022-12-13 18:34:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5916 transitions. [2022-12-13 18:34:01,147 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5916 transitions. Word has length 80 [2022-12-13 18:34:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 5916 transitions. [2022-12-13 18:34:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5916 transitions. [2022-12-13 18:34:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:34:01,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:01,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:01,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 18:34:01,150 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash 270748049, now seen corresponding path program 1 times [2022-12-13 18:34:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:01,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266958677] [2022-12-13 18:34:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:34:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:01,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266958677] [2022-12-13 18:34:01,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266958677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:01,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:01,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:34:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898397179] [2022-12-13 18:34:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:34:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:01,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:34:01,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:34:01,224 INFO L87 Difference]: Start difference. First operand 4573 states and 5916 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:02,673 INFO L93 Difference]: Finished difference Result 7514 states and 10302 transitions. [2022-12-13 18:34:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 18:34:02,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:34:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:02,684 INFO L225 Difference]: With dead ends: 7514 [2022-12-13 18:34:02,684 INFO L226 Difference]: Without dead ends: 6293 [2022-12-13 18:34:02,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:34:02,687 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 750 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:02,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1325 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:34:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2022-12-13 18:34:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5634. [2022-12-13 18:34:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5634 states, 4585 states have (on average 1.3424209378407852) internal successors, (6155), 4643 states have internal predecessors, (6155), 556 states have call successors, (556), 404 states have call predecessors, (556), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2022-12-13 18:34:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5634 states to 5634 states and 7508 transitions. [2022-12-13 18:34:03,172 INFO L78 Accepts]: Start accepts. Automaton has 5634 states and 7508 transitions. Word has length 80 [2022-12-13 18:34:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:03,172 INFO L495 AbstractCegarLoop]: Abstraction has 5634 states and 7508 transitions. [2022-12-13 18:34:03,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5634 states and 7508 transitions. [2022-12-13 18:34:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:34:03,175 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:03,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:03,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:34:03,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash 831447827, now seen corresponding path program 1 times [2022-12-13 18:34:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:03,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211707405] [2022-12-13 18:34:03,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:34:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:03,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211707405] [2022-12-13 18:34:03,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211707405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:03,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:03,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:34:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31969839] [2022-12-13 18:34:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:03,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:34:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:34:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:34:03,281 INFO L87 Difference]: Start difference. First operand 5634 states and 7508 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:04,860 INFO L93 Difference]: Finished difference Result 9406 states and 13156 transitions. [2022-12-13 18:34:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:34:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:34:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:04,873 INFO L225 Difference]: With dead ends: 9406 [2022-12-13 18:34:04,873 INFO L226 Difference]: Without dead ends: 7125 [2022-12-13 18:34:04,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:34:04,879 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 465 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:04,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1102 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:34:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7125 states. [2022-12-13 18:34:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7125 to 5685. [2022-12-13 18:34:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5685 states, 4636 states have (on average 1.3386540120793788) internal successors, (6206), 4694 states have internal predecessors, (6206), 556 states have call successors, (556), 404 states have call predecessors, (556), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2022-12-13 18:34:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5685 states to 5685 states and 7559 transitions. [2022-12-13 18:34:05,437 INFO L78 Accepts]: Start accepts. Automaton has 5685 states and 7559 transitions. Word has length 80 [2022-12-13 18:34:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:05,438 INFO L495 AbstractCegarLoop]: Abstraction has 5685 states and 7559 transitions. [2022-12-13 18:34:05,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5685 states and 7559 transitions. [2022-12-13 18:34:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:34:05,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:05,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 18:34:05,440 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 350367569, now seen corresponding path program 1 times [2022-12-13 18:34:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:05,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000128818] [2022-12-13 18:34:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:34:05,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:05,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000128818] [2022-12-13 18:34:05,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000128818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:05,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:05,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:34:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248008870] [2022-12-13 18:34:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:05,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:34:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:34:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:34:05,539 INFO L87 Difference]: Start difference. First operand 5685 states and 7559 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:08,498 INFO L93 Difference]: Finished difference Result 13719 states and 19840 transitions. [2022-12-13 18:34:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:34:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2022-12-13 18:34:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:08,520 INFO L225 Difference]: With dead ends: 13719 [2022-12-13 18:34:08,520 INFO L226 Difference]: Without dead ends: 11387 [2022-12-13 18:34:08,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 18:34:08,533 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 1554 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:08,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 1121 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 18:34:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2022-12-13 18:34:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 10008. [2022-12-13 18:34:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 8344 states have (on average 1.3851869606903164) internal successors, (11558), 8461 states have internal predecessors, (11558), 929 states have call successors, (929), 614 states have call predecessors, (929), 733 states have return successors, (1452), 954 states have call predecessors, (1452), 926 states have call successors, (1452) [2022-12-13 18:34:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 13939 transitions. [2022-12-13 18:34:09,444 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 13939 transitions. Word has length 80 [2022-12-13 18:34:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:09,444 INFO L495 AbstractCegarLoop]: Abstraction has 10008 states and 13939 transitions. [2022-12-13 18:34:09,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:34:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 13939 transitions. [2022-12-13 18:34:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 18:34:09,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:09,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:09,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 18:34:09,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1956288145, now seen corresponding path program 1 times [2022-12-13 18:34:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:09,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274385981] [2022-12-13 18:34:09,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 18:34:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:34:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:09,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274385981] [2022-12-13 18:34:09,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274385981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:09,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:09,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:34:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968018821] [2022-12-13 18:34:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:09,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:34:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:09,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:34:09,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:09,539 INFO L87 Difference]: Start difference. First operand 10008 states and 13939 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:34:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:11,536 INFO L93 Difference]: Finished difference Result 16880 states and 22356 transitions. [2022-12-13 18:34:11,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:34:11,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-12-13 18:34:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:11,558 INFO L225 Difference]: With dead ends: 16880 [2022-12-13 18:34:11,558 INFO L226 Difference]: Without dead ends: 12243 [2022-12-13 18:34:11,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:34:11,566 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 897 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:11,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1219 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:34:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12243 states. [2022-12-13 18:34:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12243 to 11923. [2022-12-13 18:34:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11923 states, 9802 states have (on average 1.3549275658028974) internal successors, (13281), 9962 states have internal predecessors, (13281), 1133 states have call successors, (1133), 788 states have call predecessors, (1133), 986 states have return successors, (1834), 1194 states have call predecessors, (1834), 1130 states have call successors, (1834) [2022-12-13 18:34:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11923 states to 11923 states and 16248 transitions. [2022-12-13 18:34:12,669 INFO L78 Accepts]: Start accepts. Automaton has 11923 states and 16248 transitions. Word has length 84 [2022-12-13 18:34:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:12,669 INFO L495 AbstractCegarLoop]: Abstraction has 11923 states and 16248 transitions. [2022-12-13 18:34:12,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:34:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 11923 states and 16248 transitions. [2022-12-13 18:34:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 18:34:12,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:12,673 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 18:34:12,674 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -197625515, now seen corresponding path program 1 times [2022-12-13 18:34:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441988525] [2022-12-13 18:34:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 18:34:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 18:34:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441988525] [2022-12-13 18:34:12,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441988525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:12,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:12,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:34:12,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540721733] [2022-12-13 18:34:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:12,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:34:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:34:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:34:12,757 INFO L87 Difference]: Start difference. First operand 11923 states and 16248 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:34:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:14,846 INFO L93 Difference]: Finished difference Result 15926 states and 21088 transitions. [2022-12-13 18:34:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 18:34:14,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-12-13 18:34:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:14,864 INFO L225 Difference]: With dead ends: 15926 [2022-12-13 18:34:14,865 INFO L226 Difference]: Without dead ends: 11333 [2022-12-13 18:34:14,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-12-13 18:34:14,871 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 1546 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:14,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1239 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:34:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11333 states. [2022-12-13 18:34:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11333 to 10999. [2022-12-13 18:34:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10999 states, 9091 states have (on average 1.3617863821361786) internal successors, (12380), 9233 states have internal predecessors, (12380), 1034 states have call successors, (1034), 703 states have call predecessors, (1034), 872 states have return successors, (1612), 1084 states have call predecessors, (1612), 1031 states have call successors, (1612) [2022-12-13 18:34:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 15026 transitions. [2022-12-13 18:34:15,888 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 15026 transitions. Word has length 93 [2022-12-13 18:34:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:15,888 INFO L495 AbstractCegarLoop]: Abstraction has 10999 states and 15026 transitions. [2022-12-13 18:34:15,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:34:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 15026 transitions. [2022-12-13 18:34:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 18:34:15,896 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:15,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:15,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 18:34:15,896 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1663679213, now seen corresponding path program 1 times [2022-12-13 18:34:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:15,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732086189] [2022-12-13 18:34:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:34:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 18:34:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 18:34:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732086189] [2022-12-13 18:34:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732086189] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824254606] [2022-12-13 18:34:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:15,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:15,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:15,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:15,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:34:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:16,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:34:16,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 18:34:16,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:16,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824254606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:16,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:16,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:34:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487136698] [2022-12-13 18:34:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:16,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:34:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:34:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:16,114 INFO L87 Difference]: Start difference. First operand 10999 states and 15026 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:34:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:17,708 INFO L93 Difference]: Finished difference Result 24036 states and 34570 transitions. [2022-12-13 18:34:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:34:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2022-12-13 18:34:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:17,748 INFO L225 Difference]: With dead ends: 24036 [2022-12-13 18:34:17,748 INFO L226 Difference]: Without dead ends: 17381 [2022-12-13 18:34:17,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:17,763 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 311 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:17,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2022-12-13 18:34:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 17273. [2022-12-13 18:34:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17273 states, 14503 states have (on average 1.3946080121354203) internal successors, (20226), 14720 states have internal predecessors, (20226), 1540 states have call successors, (1540), 1011 states have call predecessors, (1540), 1228 states have return successors, (2455), 1563 states have call predecessors, (2455), 1537 states have call successors, (2455) [2022-12-13 18:34:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 24221 transitions. [2022-12-13 18:34:19,428 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 24221 transitions. Word has length 129 [2022-12-13 18:34:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:19,428 INFO L495 AbstractCegarLoop]: Abstraction has 17273 states and 24221 transitions. [2022-12-13 18:34:19,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 18:34:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 24221 transitions. [2022-12-13 18:34:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 18:34:19,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:19,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:19,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:34:19,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:19,642 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 389348365, now seen corresponding path program 1 times [2022-12-13 18:34:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256202947] [2022-12-13 18:34:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:34:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 18:34:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 18:34:19,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256202947] [2022-12-13 18:34:19,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256202947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865712422] [2022-12-13 18:34:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:19,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:19,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:34:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:19,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:34:19,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:34:19,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:19,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865712422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:19,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:34:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75846928] [2022-12-13 18:34:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:19,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:34:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:34:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:19,865 INFO L87 Difference]: Start difference. First operand 17273 states and 24221 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:34:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:22,627 INFO L93 Difference]: Finished difference Result 42508 states and 61581 transitions. [2022-12-13 18:34:22,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:34:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 129 [2022-12-13 18:34:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:22,690 INFO L225 Difference]: With dead ends: 42508 [2022-12-13 18:34:22,691 INFO L226 Difference]: Without dead ends: 19542 [2022-12-13 18:34:22,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:22,713 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 192 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:22,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 918 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19542 states. [2022-12-13 18:34:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19542 to 19542. [2022-12-13 18:34:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19542 states, 16465 states have (on average 1.3992104464014576) internal successors, (23038), 16698 states have internal predecessors, (23038), 1723 states have call successors, (1723), 1119 states have call predecessors, (1723), 1352 states have return successors, (2769), 1746 states have call predecessors, (2769), 1720 states have call successors, (2769) [2022-12-13 18:34:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19542 states to 19542 states and 27530 transitions. [2022-12-13 18:34:24,448 INFO L78 Accepts]: Start accepts. Automaton has 19542 states and 27530 transitions. Word has length 129 [2022-12-13 18:34:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:24,448 INFO L495 AbstractCegarLoop]: Abstraction has 19542 states and 27530 transitions. [2022-12-13 18:34:24,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:34:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 19542 states and 27530 transitions. [2022-12-13 18:34:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 18:34:24,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:24,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:24,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:34:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 18:34:24,663 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1234059877, now seen corresponding path program 1 times [2022-12-13 18:34:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:24,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624853386] [2022-12-13 18:34:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 18:34:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 18:34:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:34:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:34:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 18:34:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 18:34:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 18:34:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 18:34:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:24,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624853386] [2022-12-13 18:34:24,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624853386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262322517] [2022-12-13 18:34:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:24,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:24,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:24,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:34:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:24,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:34:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 18:34:24,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:24,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262322517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:24,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:24,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-12-13 18:34:24,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260702074] [2022-12-13 18:34:24,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:24,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:34:24,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:34:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:34:24,873 INFO L87 Difference]: Start difference. First operand 19542 states and 27530 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 18:34:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:26,603 INFO L93 Difference]: Finished difference Result 21708 states and 30153 transitions. [2022-12-13 18:34:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:34:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-12-13 18:34:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:26,644 INFO L225 Difference]: With dead ends: 21708 [2022-12-13 18:34:26,644 INFO L226 Difference]: Without dead ends: 17403 [2022-12-13 18:34:26,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:34:26,653 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 34 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:26,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1780 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2022-12-13 18:34:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 17278. [2022-12-13 18:34:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17278 states, 14778 states have (on average 1.4199485722019218) internal successors, (20984), 14960 states have internal predecessors, (20984), 1447 states have call successors, (1447), 885 states have call predecessors, (1447), 1051 states have return successors, (2376), 1448 states have call predecessors, (2376), 1444 states have call successors, (2376) [2022-12-13 18:34:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17278 states to 17278 states and 24807 transitions. [2022-12-13 18:34:28,169 INFO L78 Accepts]: Start accepts. Automaton has 17278 states and 24807 transitions. Word has length 145 [2022-12-13 18:34:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:28,169 INFO L495 AbstractCegarLoop]: Abstraction has 17278 states and 24807 transitions. [2022-12-13 18:34:28,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 18:34:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 17278 states and 24807 transitions. [2022-12-13 18:34:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-13 18:34:28,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:28,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:28,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:34:28,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 18:34:28,384 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1525119333, now seen corresponding path program 1 times [2022-12-13 18:34:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:28,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119703508] [2022-12-13 18:34:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 18:34:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 18:34:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 18:34:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:34:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 18:34:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 18:34:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 18:34:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:34:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119703508] [2022-12-13 18:34:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119703508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:28,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:28,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:34:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630469818] [2022-12-13 18:34:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:28,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:34:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:34:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:34:28,452 INFO L87 Difference]: Start difference. First operand 17278 states and 24807 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 18:34:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:30,146 INFO L93 Difference]: Finished difference Result 17343 states and 24875 transitions. [2022-12-13 18:34:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:34:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-12-13 18:34:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:30,178 INFO L225 Difference]: With dead ends: 17343 [2022-12-13 18:34:30,178 INFO L226 Difference]: Without dead ends: 16900 [2022-12-13 18:34:30,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:34:30,185 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 526 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:30,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 662 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:34:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16900 states. [2022-12-13 18:34:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16900 to 16838. [2022-12-13 18:34:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16838 states, 14434 states have (on average 1.4258001939864209) internal successors, (20580), 14613 states have internal predecessors, (20580), 1401 states have call successors, (1401), 845 states have call predecessors, (1401), 1001 states have return successors, (2312), 1395 states have call predecessors, (2312), 1398 states have call successors, (2312) [2022-12-13 18:34:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16838 states to 16838 states and 24293 transitions. [2022-12-13 18:34:31,645 INFO L78 Accepts]: Start accepts. Automaton has 16838 states and 24293 transitions. Word has length 147 [2022-12-13 18:34:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:31,645 INFO L495 AbstractCegarLoop]: Abstraction has 16838 states and 24293 transitions. [2022-12-13 18:34:31,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 18:34:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16838 states and 24293 transitions. [2022-12-13 18:34:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 18:34:31,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:31,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:31,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 18:34:31,659 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1268854173, now seen corresponding path program 1 times [2022-12-13 18:34:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:31,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381734492] [2022-12-13 18:34:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:34:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:34:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 18:34:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:34:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 18:34:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 18:34:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 18:34:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 18:34:31,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:31,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381734492] [2022-12-13 18:34:31,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381734492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:31,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:34:31,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:34:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128299087] [2022-12-13 18:34:31,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:31,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:34:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:34:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:34:31,756 INFO L87 Difference]: Start difference. First operand 16838 states and 24293 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:34:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:33,538 INFO L93 Difference]: Finished difference Result 18315 states and 26092 transitions. [2022-12-13 18:34:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:34:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-12-13 18:34:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:33,576 INFO L225 Difference]: With dead ends: 18315 [2022-12-13 18:34:33,577 INFO L226 Difference]: Without dead ends: 16939 [2022-12-13 18:34:33,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:34:33,582 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 456 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:33,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 982 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:34:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16939 states. [2022-12-13 18:34:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16939 to 16747. [2022-12-13 18:34:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16747 states, 14365 states have (on average 1.4267316394013227) internal successors, (20495), 14545 states have internal predecessors, (20495), 1392 states have call successors, (1392), 840 states have call predecessors, (1392), 988 states have return successors, (2296), 1377 states have call predecessors, (2296), 1389 states have call successors, (2296) [2022-12-13 18:34:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16747 states to 16747 states and 24183 transitions. [2022-12-13 18:34:35,028 INFO L78 Accepts]: Start accepts. Automaton has 16747 states and 24183 transitions. Word has length 159 [2022-12-13 18:34:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:35,028 INFO L495 AbstractCegarLoop]: Abstraction has 16747 states and 24183 transitions. [2022-12-13 18:34:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:34:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 16747 states and 24183 transitions. [2022-12-13 18:34:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 18:34:35,042 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:35,042 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:35,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 18:34:35,042 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 35384604, now seen corresponding path program 1 times [2022-12-13 18:34:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:35,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836772521] [2022-12-13 18:34:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:34:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:34:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:34:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:34:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:34:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:34:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 18:34:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 18:34:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 18:34:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 18:34:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 18:34:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 18:34:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836772521] [2022-12-13 18:34:35,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836772521] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448406958] [2022-12-13 18:34:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:35,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:35,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:35,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:35,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:34:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:35,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 18:34:35,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 18:34:35,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:34:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 18:34:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448406958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:34:35,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:34:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-12-13 18:34:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731290404] [2022-12-13 18:34:35,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:34:35,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:34:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:34:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:34:35,521 INFO L87 Difference]: Start difference. First operand 16747 states and 24183 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-12-13 18:34:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:37,735 INFO L93 Difference]: Finished difference Result 18719 states and 26636 transitions. [2022-12-13 18:34:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 18:34:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-12-13 18:34:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:37,766 INFO L225 Difference]: With dead ends: 18719 [2022-12-13 18:34:37,766 INFO L226 Difference]: Without dead ends: 17287 [2022-12-13 18:34:37,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-12-13 18:34:37,774 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 1160 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:37,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1200 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:34:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17287 states. [2022-12-13 18:34:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17287 to 17137. [2022-12-13 18:34:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17137 states, 14643 states have (on average 1.4203373625623166) internal successors, (20798), 14831 states have internal predecessors, (20798), 1446 states have call successors, (1446), 890 states have call predecessors, (1446), 1046 states have return successors, (2410), 1431 states have call predecessors, (2410), 1443 states have call successors, (2410) [2022-12-13 18:34:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17137 states to 17137 states and 24654 transitions. [2022-12-13 18:34:39,297 INFO L78 Accepts]: Start accepts. Automaton has 17137 states and 24654 transitions. Word has length 162 [2022-12-13 18:34:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:39,298 INFO L495 AbstractCegarLoop]: Abstraction has 17137 states and 24654 transitions. [2022-12-13 18:34:39,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-12-13 18:34:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17137 states and 24654 transitions. [2022-12-13 18:34:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 18:34:39,329 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:39,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:39,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 18:34:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 18:34:39,531 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1043385329, now seen corresponding path program 1 times [2022-12-13 18:34:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:39,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724537130] [2022-12-13 18:34:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:34:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 18:34:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 18:34:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:34:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:39,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724537130] [2022-12-13 18:34:39,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724537130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:39,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432579885] [2022-12-13 18:34:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:39,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:39,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:34:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:39,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:34:39,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:34:39,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:39,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432579885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:39,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:39,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:34:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310300621] [2022-12-13 18:34:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:39,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:34:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:34:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:39,825 INFO L87 Difference]: Start difference. First operand 17137 states and 24654 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:34:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:42,526 INFO L93 Difference]: Finished difference Result 47078 states and 69363 transitions. [2022-12-13 18:34:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:34:42,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2022-12-13 18:34:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:42,590 INFO L225 Difference]: With dead ends: 47078 [2022-12-13 18:34:42,590 INFO L226 Difference]: Without dead ends: 31880 [2022-12-13 18:34:42,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:42,616 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 264 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:42,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 579 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31880 states. [2022-12-13 18:34:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31880 to 31632. [2022-12-13 18:34:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31632 states, 27121 states have (on average 1.4300726374396224) internal successors, (38785), 27475 states have internal predecessors, (38785), 2627 states have call successors, (2627), 1614 states have call predecessors, (2627), 1882 states have return successors, (4383), 2558 states have call predecessors, (4383), 2624 states have call successors, (4383) [2022-12-13 18:34:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31632 states to 31632 states and 45795 transitions. [2022-12-13 18:34:45,475 INFO L78 Accepts]: Start accepts. Automaton has 31632 states and 45795 transitions. Word has length 167 [2022-12-13 18:34:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:45,475 INFO L495 AbstractCegarLoop]: Abstraction has 31632 states and 45795 transitions. [2022-12-13 18:34:45,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:34:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31632 states and 45795 transitions. [2022-12-13 18:34:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 18:34:45,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:45,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:45,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:34:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:45,707 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -932684503, now seen corresponding path program 1 times [2022-12-13 18:34:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480201568] [2022-12-13 18:34:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:34:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:34:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:34:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:34:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 18:34:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:34:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 18:34:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:34:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480201568] [2022-12-13 18:34:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480201568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798416361] [2022-12-13 18:34:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:45,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:45,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:34:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:45,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:34:45,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:34:45,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798416361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:45,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:34:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335143048] [2022-12-13 18:34:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:34:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:34:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:45,985 INFO L87 Difference]: Start difference. First operand 31632 states and 45795 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:34:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:49,771 INFO L93 Difference]: Finished difference Result 63101 states and 92719 transitions. [2022-12-13 18:34:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:34:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 167 [2022-12-13 18:34:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:49,887 INFO L225 Difference]: With dead ends: 63101 [2022-12-13 18:34:49,887 INFO L226 Difference]: Without dead ends: 45005 [2022-12-13 18:34:49,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:49,923 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 265 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:49,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 600 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45005 states. [2022-12-13 18:34:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45005 to 44649. [2022-12-13 18:34:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44649 states, 38388 states have (on average 1.4363863707408566) internal successors, (55140), 38874 states have internal predecessors, (55140), 3646 states have call successors, (3646), 2249 states have call predecessors, (3646), 2613 states have return successors, (5969), 3541 states have call predecessors, (5969), 3643 states have call successors, (5969) [2022-12-13 18:34:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44649 states to 44649 states and 64755 transitions. [2022-12-13 18:34:54,203 INFO L78 Accepts]: Start accepts. Automaton has 44649 states and 64755 transitions. Word has length 167 [2022-12-13 18:34:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:34:54,204 INFO L495 AbstractCegarLoop]: Abstraction has 44649 states and 64755 transitions. [2022-12-13 18:34:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:34:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 44649 states and 64755 transitions. [2022-12-13 18:34:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 18:34:54,239 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:34:54,239 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:34:54,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 18:34:54,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:54,441 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:34:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:34:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 99767870, now seen corresponding path program 1 times [2022-12-13 18:34:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:34:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983591333] [2022-12-13 18:34:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:54,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:34:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:34:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:34:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 18:34:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 18:34:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:34:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 18:34:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 18:34:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:34:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 18:34:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 18:34:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:34:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:34:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 18:34:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 18:34:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 18:34:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-12-13 18:34:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:34:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983591333] [2022-12-13 18:34:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983591333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:34:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526566897] [2022-12-13 18:34:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:34:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:34:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:34:54,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:34:54,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:34:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:34:54,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:34:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:34:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 18:34:54,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:34:54,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526566897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:34:54,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:34:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:34:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019774064] [2022-12-13 18:34:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:34:54,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:34:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:34:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:34:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:54,697 INFO L87 Difference]: Start difference. First operand 44649 states and 64755 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 18:34:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:34:58,747 INFO L93 Difference]: Finished difference Result 46411 states and 66884 transitions. [2022-12-13 18:34:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:34:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 179 [2022-12-13 18:34:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:34:58,837 INFO L225 Difference]: With dead ends: 46411 [2022-12-13 18:34:58,837 INFO L226 Difference]: Without dead ends: 44656 [2022-12-13 18:34:58,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:34:58,854 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 33 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:34:58,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 738 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:34:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44656 states. [2022-12-13 18:35:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44656 to 44649. [2022-12-13 18:35:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44649 states, 38388 states have (on average 1.4362300718974679) internal successors, (55134), 38874 states have internal predecessors, (55134), 3646 states have call successors, (3646), 2249 states have call predecessors, (3646), 2613 states have return successors, (5969), 3541 states have call predecessors, (5969), 3643 states have call successors, (5969) [2022-12-13 18:35:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44649 states to 44649 states and 64749 transitions. [2022-12-13 18:35:02,845 INFO L78 Accepts]: Start accepts. Automaton has 44649 states and 64749 transitions. Word has length 179 [2022-12-13 18:35:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:02,845 INFO L495 AbstractCegarLoop]: Abstraction has 44649 states and 64749 transitions. [2022-12-13 18:35:02,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 18:35:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 44649 states and 64749 transitions. [2022-12-13 18:35:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 18:35:02,880 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:02,880 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:02,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 18:35:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:03,082 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1939442957, now seen corresponding path program 1 times [2022-12-13 18:35:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:03,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687958406] [2022-12-13 18:35:03,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:03,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:35:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 18:35:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:35:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:35:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 18:35:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 18:35:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 18:35:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:35:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 18:35:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 18:35:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:35:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:35:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 18:35:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 18:35:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 18:35:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 18:35:03,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687958406] [2022-12-13 18:35:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687958406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109635139] [2022-12-13 18:35:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:03,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:03,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:03,186 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:03,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:35:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:03,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:35:03,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 18:35:03,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:35:03,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109635139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:03,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:35:03,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:35:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147209971] [2022-12-13 18:35:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:03,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:35:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:35:03,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:35:03,280 INFO L87 Difference]: Start difference. First operand 44649 states and 64749 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:35:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:07,696 INFO L93 Difference]: Finished difference Result 46476 states and 66946 transitions. [2022-12-13 18:35:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:35:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2022-12-13 18:35:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:07,795 INFO L225 Difference]: With dead ends: 46476 [2022-12-13 18:35:07,795 INFO L226 Difference]: Without dead ends: 44361 [2022-12-13 18:35:07,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:35:07,816 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 457 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 591 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:35:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44361 states. [2022-12-13 18:35:11,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44361 to 44319. [2022-12-13 18:35:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44319 states, 38135 states have (on average 1.4376294742362659) internal successors, (54824), 38614 states have internal predecessors, (54824), 3611 states have call successors, (3611), 2218 states have call predecessors, (3611), 2571 states have return successors, (5895), 3502 states have call predecessors, (5895), 3608 states have call successors, (5895) [2022-12-13 18:35:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44319 states to 44319 states and 64330 transitions. [2022-12-13 18:35:11,972 INFO L78 Accepts]: Start accepts. Automaton has 44319 states and 64330 transitions. Word has length 179 [2022-12-13 18:35:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:11,973 INFO L495 AbstractCegarLoop]: Abstraction has 44319 states and 64330 transitions. [2022-12-13 18:35:11,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 18:35:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44319 states and 64330 transitions. [2022-12-13 18:35:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:35:12,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:12,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:12,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:35:12,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:12,213 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash -665339890, now seen corresponding path program 1 times [2022-12-13 18:35:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183345390] [2022-12-13 18:35:12,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:35:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:35:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:35:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:35:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:35:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 18:35:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:35:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-12-13 18:35:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183345390] [2022-12-13 18:35:12,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183345390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:12,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745836676] [2022-12-13 18:35:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:12,318 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:12,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:35:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:12,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:35:12,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 18:35:12,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:35:12,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745836676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:12,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:35:12,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:35:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653758506] [2022-12-13 18:35:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:12,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:12,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:12,449 INFO L87 Difference]: Start difference. First operand 44319 states and 64330 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 18:35:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:16,809 INFO L93 Difference]: Finished difference Result 83681 states and 121879 transitions. [2022-12-13 18:35:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 185 [2022-12-13 18:35:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:16,893 INFO L225 Difference]: With dead ends: 83681 [2022-12-13 18:35:16,893 INFO L226 Difference]: Without dead ends: 40972 [2022-12-13 18:35:16,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:16,951 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 287 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:16,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 402 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:35:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40972 states. [2022-12-13 18:35:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40972 to 40972. [2022-12-13 18:35:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40972 states, 35500 states have (on average 1.3872394366197183) internal successors, (49247), 35843 states have internal predecessors, (49247), 3068 states have call successors, (3068), 2113 states have call predecessors, (3068), 2402 states have return successors, (4761), 3031 states have call predecessors, (4761), 3065 states have call successors, (4761) [2022-12-13 18:35:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40972 states to 40972 states and 57076 transitions. [2022-12-13 18:35:21,284 INFO L78 Accepts]: Start accepts. Automaton has 40972 states and 57076 transitions. Word has length 185 [2022-12-13 18:35:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:21,284 INFO L495 AbstractCegarLoop]: Abstraction has 40972 states and 57076 transitions. [2022-12-13 18:35:21,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 18:35:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 40972 states and 57076 transitions. [2022-12-13 18:35:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:35:21,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:21,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:21,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:21,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 18:35:21,523 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2064215632, now seen corresponding path program 1 times [2022-12-13 18:35:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:21,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549180817] [2022-12-13 18:35:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:35:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:35:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:35:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:35:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:35:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 18:35:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:35:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:35:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549180817] [2022-12-13 18:35:21,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549180817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626745426] [2022-12-13 18:35:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:21,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:21,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:35:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:21,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:35:21,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 18:35:21,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:35:21,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626745426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:21,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:35:21,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:35:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598899954] [2022-12-13 18:35:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:21,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:21,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:21,749 INFO L87 Difference]: Start difference. First operand 40972 states and 57076 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 18:35:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:25,815 INFO L93 Difference]: Finished difference Result 70357 states and 99377 transitions. [2022-12-13 18:35:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 185 [2022-12-13 18:35:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:25,892 INFO L225 Difference]: With dead ends: 70357 [2022-12-13 18:35:25,892 INFO L226 Difference]: Without dead ends: 36407 [2022-12-13 18:35:25,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:25,937 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 303 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:25,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 397 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:35:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36407 states. [2022-12-13 18:35:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36407 to 26819. [2022-12-13 18:35:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26819 states, 23242 states have (on average 1.3386541605713793) internal successors, (31113), 23429 states have internal predecessors, (31113), 1977 states have call successors, (1977), 1437 states have call predecessors, (1977), 1598 states have return successors, (2756), 1960 states have call predecessors, (2756), 1974 states have call successors, (2756) [2022-12-13 18:35:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26819 states to 26819 states and 35846 transitions. [2022-12-13 18:35:29,438 INFO L78 Accepts]: Start accepts. Automaton has 26819 states and 35846 transitions. Word has length 185 [2022-12-13 18:35:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 26819 states and 35846 transitions. [2022-12-13 18:35:29,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 18:35:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26819 states and 35846 transitions. [2022-12-13 18:35:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:35:29,458 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:29,458 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:29,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:29,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 18:35:29,659 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1794271634, now seen corresponding path program 1 times [2022-12-13 18:35:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:29,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464814965] [2022-12-13 18:35:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:35:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:35:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:35:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:35:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:35:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 18:35:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:35:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,750 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:35:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:29,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464814965] [2022-12-13 18:35:29,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464814965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:29,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170698399] [2022-12-13 18:35:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:29,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:29,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:29,752 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:29,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:35:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:29,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:35:29,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 18:35:29,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:35:29,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170698399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:29,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:35:29,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:35:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362853373] [2022-12-13 18:35:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:29,843 INFO L87 Difference]: Start difference. First operand 26819 states and 35846 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 18:35:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:33,603 INFO L93 Difference]: Finished difference Result 54238 states and 72427 transitions. [2022-12-13 18:35:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:33,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 185 [2022-12-13 18:35:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:33,661 INFO L225 Difference]: With dead ends: 54238 [2022-12-13 18:35:33,661 INFO L226 Difference]: Without dead ends: 29029 [2022-12-13 18:35:33,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:33,696 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 317 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:33,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 585 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:35:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29029 states. [2022-12-13 18:35:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29029 to 28639. [2022-12-13 18:35:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28639 states, 24941 states have (on average 1.3088889779880517) internal successors, (32645), 25117 states have internal predecessors, (32645), 1988 states have call successors, (1988), 1536 states have call predecessors, (1988), 1708 states have return successors, (2745), 1993 states have call predecessors, (2745), 1985 states have call successors, (2745) [2022-12-13 18:35:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 37378 transitions. [2022-12-13 18:35:37,486 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 37378 transitions. Word has length 185 [2022-12-13 18:35:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:37,486 INFO L495 AbstractCegarLoop]: Abstraction has 28639 states and 37378 transitions. [2022-12-13 18:35:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 18:35:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 37378 transitions. [2022-12-13 18:35:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 18:35:37,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:37,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:37,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:37,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 18:35:37,706 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash 119617118, now seen corresponding path program 1 times [2022-12-13 18:35:37,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:37,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892331048] [2022-12-13 18:35:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:35:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:35:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:35:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:35:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:35:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 18:35:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:35:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-12-13 18:35:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:37,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892331048] [2022-12-13 18:35:37,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892331048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:35:37,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755489924] [2022-12-13 18:35:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:35:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:35:37,814 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:35:37,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:35:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:37,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:35:37,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:35:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 18:35:37,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:35:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755489924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:37,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:35:37,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:35:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614002594] [2022-12-13 18:35:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:37,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:35:37,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:35:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:37,931 INFO L87 Difference]: Start difference. First operand 28639 states and 37378 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 18:35:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:35:45,069 INFO L93 Difference]: Finished difference Result 81883 states and 108288 transitions. [2022-12-13 18:35:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:35:45,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 186 [2022-12-13 18:35:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:35:45,174 INFO L225 Difference]: With dead ends: 81883 [2022-12-13 18:35:45,174 INFO L226 Difference]: Without dead ends: 54854 [2022-12-13 18:35:45,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:35:45,211 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 309 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:35:45,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 625 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:35:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54854 states. [2022-12-13 18:35:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54854 to 54473. [2022-12-13 18:35:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54473 states, 47624 states have (on average 1.3048882916176718) internal successors, (62144), 47962 states have internal predecessors, (62144), 3677 states have call successors, (3677), 2870 states have call predecessors, (3677), 3170 states have return successors, (6265), 3656 states have call predecessors, (6265), 3674 states have call successors, (6265) [2022-12-13 18:35:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54473 states to 54473 states and 72086 transitions. [2022-12-13 18:35:52,620 INFO L78 Accepts]: Start accepts. Automaton has 54473 states and 72086 transitions. Word has length 186 [2022-12-13 18:35:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:35:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 54473 states and 72086 transitions. [2022-12-13 18:35:52,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 18:35:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 54473 states and 72086 transitions. [2022-12-13 18:35:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 18:35:52,665 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:35:52,665 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:35:52,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 18:35:52,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 18:35:52,867 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:35:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:35:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1281738148, now seen corresponding path program 1 times [2022-12-13 18:35:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:35:52,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769683062] [2022-12-13 18:35:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:35:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:35:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:35:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:35:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:35:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:35:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:35:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:35:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:35:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 18:35:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:35:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:35:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:35:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-13 18:35:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:35:52,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769683062] [2022-12-13 18:35:52,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769683062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:35:52,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:35:52,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:35:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470846322] [2022-12-13 18:35:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:35:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:35:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:35:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:35:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:35:52,943 INFO L87 Difference]: Start difference. First operand 54473 states and 72086 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:36:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:01,068 INFO L93 Difference]: Finished difference Result 105944 states and 140056 transitions. [2022-12-13 18:36:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:36:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 186 [2022-12-13 18:36:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:01,182 INFO L225 Difference]: With dead ends: 105944 [2022-12-13 18:36:01,183 INFO L226 Difference]: Without dead ends: 53080 [2022-12-13 18:36:01,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:36:01,247 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 505 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:01,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 561 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:36:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53080 states. [2022-12-13 18:36:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53080 to 45388. [2022-12-13 18:36:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45388 states, 39766 states have (on average 1.3042297440024142) internal successors, (51864), 40244 states have internal predecessors, (51864), 2820 states have call successors, (2820), 2192 states have call predecessors, (2820), 2800 states have return successors, (5155), 2959 states have call predecessors, (5155), 2817 states have call successors, (5155) [2022-12-13 18:36:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45388 states to 45388 states and 59839 transitions. [2022-12-13 18:36:07,999 INFO L78 Accepts]: Start accepts. Automaton has 45388 states and 59839 transitions. Word has length 186 [2022-12-13 18:36:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 45388 states and 59839 transitions. [2022-12-13 18:36:07,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:36:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 45388 states and 59839 transitions. [2022-12-13 18:36:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-13 18:36:08,032 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:08,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 18:36:08,033 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:36:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1988840800, now seen corresponding path program 1 times [2022-12-13 18:36:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:08,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715887044] [2022-12-13 18:36:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:36:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:36:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:36:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:36:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:36:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 18:36:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 18:36:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 18:36:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 18:36:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 18:36:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715887044] [2022-12-13 18:36:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715887044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173612513] [2022-12-13 18:36:08,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:08,119 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:08,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:36:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:08,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:36:08,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 18:36:08,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:36:08,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173612513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:08,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:36:08,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:36:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884639419] [2022-12-13 18:36:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:36:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:36:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:36:08,230 INFO L87 Difference]: Start difference. First operand 45388 states and 59839 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 18:36:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:20,419 INFO L93 Difference]: Finished difference Result 128822 states and 172157 transitions. [2022-12-13 18:36:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:36:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 188 [2022-12-13 18:36:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:20,597 INFO L225 Difference]: With dead ends: 128822 [2022-12-13 18:36:20,597 INFO L226 Difference]: Without dead ends: 85044 [2022-12-13 18:36:20,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:36:20,654 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 314 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:20,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 617 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:36:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85044 states. [2022-12-13 18:36:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85044 to 83486. [2022-12-13 18:36:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83486 states, 73097 states have (on average 1.3014077185110196) internal successors, (95129), 74001 states have internal predecessors, (95129), 5255 states have call successors, (5255), 4025 states have call predecessors, (5255), 5132 states have return successors, (11515), 5475 states have call predecessors, (11515), 5252 states have call successors, (11515) [2022-12-13 18:36:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83486 states to 83486 states and 111899 transitions. [2022-12-13 18:36:32,970 INFO L78 Accepts]: Start accepts. Automaton has 83486 states and 111899 transitions. Word has length 188 [2022-12-13 18:36:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:32,971 INFO L495 AbstractCegarLoop]: Abstraction has 83486 states and 111899 transitions. [2022-12-13 18:36:32,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 18:36:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 83486 states and 111899 transitions. [2022-12-13 18:36:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-13 18:36:33,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:33,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:33,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 18:36:33,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 18:36:33,242 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:36:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1950389858, now seen corresponding path program 1 times [2022-12-13 18:36:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003208329] [2022-12-13 18:36:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:36:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:36:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:36:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:36:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:36:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 18:36:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 18:36:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 18:36:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 18:36:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-12-13 18:36:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003208329] [2022-12-13 18:36:33,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003208329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:33,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:36:33,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:36:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686362387] [2022-12-13 18:36:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:33,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:36:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:36:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:36:33,329 INFO L87 Difference]: Start difference. First operand 83486 states and 111899 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:36:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:36:45,344 INFO L93 Difference]: Finished difference Result 155347 states and 207794 transitions. [2022-12-13 18:36:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:36:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 188 [2022-12-13 18:36:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:36:45,495 INFO L225 Difference]: With dead ends: 155347 [2022-12-13 18:36:45,495 INFO L226 Difference]: Without dead ends: 73470 [2022-12-13 18:36:45,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:36:45,581 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 503 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:36:45,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 559 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:36:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73470 states. [2022-12-13 18:36:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73470 to 65291. [2022-12-13 18:36:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65291 states, 57199 states have (on average 1.3043235021591286) internal successors, (74606), 58029 states have internal predecessors, (74606), 3946 states have call successors, (3946), 3039 states have call predecessors, (3946), 4144 states have return successors, (8507), 4230 states have call predecessors, (8507), 3943 states have call successors, (8507) [2022-12-13 18:36:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65291 states to 65291 states and 87059 transitions. [2022-12-13 18:36:56,135 INFO L78 Accepts]: Start accepts. Automaton has 65291 states and 87059 transitions. Word has length 188 [2022-12-13 18:36:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:36:56,135 INFO L495 AbstractCegarLoop]: Abstraction has 65291 states and 87059 transitions. [2022-12-13 18:36:56,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:36:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 65291 states and 87059 transitions. [2022-12-13 18:36:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-13 18:36:56,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:36:56,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:36:56,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 18:36:56,235 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:36:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:36:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1595262810, now seen corresponding path program 1 times [2022-12-13 18:36:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:36:56,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272449298] [2022-12-13 18:36:56,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:36:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:36:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:36:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:36:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:36:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:36:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:36:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:36:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 18:36:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:36:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 18:36:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 18:36:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:36:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272449298] [2022-12-13 18:36:56,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272449298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:36:56,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354413759] [2022-12-13 18:36:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:36:56,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:36:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:36:56,344 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:36:56,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 18:36:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:36:56,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:36:56,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:36:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:36:56,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:36:56,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354413759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:36:56,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:36:56,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:36:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543438972] [2022-12-13 18:36:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:36:56,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:36:56,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:36:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:36:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:36:56,450 INFO L87 Difference]: Start difference. First operand 65291 states and 87059 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:37:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:37:06,498 INFO L93 Difference]: Finished difference Result 110829 states and 152560 transitions. [2022-12-13 18:37:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:37:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 190 [2022-12-13 18:37:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:37:06,629 INFO L225 Difference]: With dead ends: 110829 [2022-12-13 18:37:06,629 INFO L226 Difference]: Without dead ends: 65555 [2022-12-13 18:37:06,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:37:06,689 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 170 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:37:06,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 855 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:37:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65555 states. [2022-12-13 18:37:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65555 to 65291. [2022-12-13 18:37:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65291 states, 57199 states have (on average 1.2790258570954038) internal successors, (73159), 58029 states have internal predecessors, (73159), 3946 states have call successors, (3946), 3039 states have call predecessors, (3946), 4144 states have return successors, (8507), 4230 states have call predecessors, (8507), 3943 states have call successors, (8507) [2022-12-13 18:37:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65291 states to 65291 states and 85612 transitions. [2022-12-13 18:37:16,932 INFO L78 Accepts]: Start accepts. Automaton has 65291 states and 85612 transitions. Word has length 190 [2022-12-13 18:37:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:37:16,932 INFO L495 AbstractCegarLoop]: Abstraction has 65291 states and 85612 transitions. [2022-12-13 18:37:16,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:37:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 65291 states and 85612 transitions. [2022-12-13 18:37:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 18:37:16,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:37:16,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:37:16,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 18:37:17,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:37:17,188 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:37:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:37:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1347129113, now seen corresponding path program 1 times [2022-12-13 18:37:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:37:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965545977] [2022-12-13 18:37:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:37:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:37:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:37:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:37:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:37:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:37:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:37:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:37:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:37:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 18:37:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 18:37:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:37:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 18:37:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-12-13 18:37:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:37:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965545977] [2022-12-13 18:37:17,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965545977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:37:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470528734] [2022-12-13 18:37:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:37:17,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:37:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:37:17,298 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:37:17,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 18:37:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:17,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:37:17,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:37:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:37:17,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:37:17,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470528734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:37:17,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:37:17,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:37:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272633144] [2022-12-13 18:37:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:37:17,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:37:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:37:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:37:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:37:17,405 INFO L87 Difference]: Start difference. First operand 65291 states and 85612 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:37:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:37:35,005 INFO L93 Difference]: Finished difference Result 179946 states and 239390 transitions. [2022-12-13 18:37:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:37:35,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2022-12-13 18:37:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:37:35,294 INFO L225 Difference]: With dead ends: 179946 [2022-12-13 18:37:35,294 INFO L226 Difference]: Without dead ends: 116265 [2022-12-13 18:37:35,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:37:35,390 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 184 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:37:35,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 894 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:37:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116265 states. [2022-12-13 18:37:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116265 to 116261. [2022-12-13 18:37:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116261 states, 101604 states have (on average 1.2834534073461674) internal successors, (130404), 103104 states have internal predecessors, (130404), 7279 states have call successors, (7279), 5491 states have call predecessors, (7279), 7376 states have return successors, (17597), 7681 states have call predecessors, (17597), 7276 states have call successors, (17597) [2022-12-13 18:37:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116261 states to 116261 states and 155280 transitions. [2022-12-13 18:37:53,505 INFO L78 Accepts]: Start accepts. Automaton has 116261 states and 155280 transitions. Word has length 191 [2022-12-13 18:37:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:37:53,505 INFO L495 AbstractCegarLoop]: Abstraction has 116261 states and 155280 transitions. [2022-12-13 18:37:53,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 18:37:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 116261 states and 155280 transitions. [2022-12-13 18:37:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:37:53,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:37:53,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:37:53,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 18:37:53,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:37:53,815 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:37:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:37:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 435877618, now seen corresponding path program 1 times [2022-12-13 18:37:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:37:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615117555] [2022-12-13 18:37:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:37:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:37:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:37:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:37:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:37:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:37:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:37:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:37:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:37:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:37:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:37:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:37:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:37:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:37:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:37:53,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615117555] [2022-12-13 18:37:53,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615117555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:37:53,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437213527] [2022-12-13 18:37:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:37:53,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:37:53,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:37:53,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:37:53,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 18:37:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:37:54,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:37:54,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:37:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:37:54,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:37:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437213527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:37:54,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:37:54,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:37:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123599093] [2022-12-13 18:37:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:37:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:37:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:37:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:37:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:37:54,085 INFO L87 Difference]: Start difference. First operand 116261 states and 155280 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:38:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:38:16,714 INFO L93 Difference]: Finished difference Result 246664 states and 337440 transitions. [2022-12-13 18:38:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:38:16,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2022-12-13 18:38:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:38:17,032 INFO L225 Difference]: With dead ends: 246664 [2022-12-13 18:38:17,033 INFO L226 Difference]: Without dead ends: 132013 [2022-12-13 18:38:17,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:38:17,210 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 449 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:38:17,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 553 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:38:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132013 states. [2022-12-13 18:38:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132013 to 124233. [2022-12-13 18:38:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124233 states, 109260 states have (on average 1.2458081640124474) internal successors, (136117), 110868 states have internal predecessors, (136117), 7279 states have call successors, (7279), 5699 states have call predecessors, (7279), 7692 states have return successors, (17060), 7681 states have call predecessors, (17060), 7276 states have call successors, (17060) [2022-12-13 18:38:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124233 states to 124233 states and 160456 transitions. [2022-12-13 18:38:37,693 INFO L78 Accepts]: Start accepts. Automaton has 124233 states and 160456 transitions. Word has length 192 [2022-12-13 18:38:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:38:37,693 INFO L495 AbstractCegarLoop]: Abstraction has 124233 states and 160456 transitions. [2022-12-13 18:38:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:38:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 124233 states and 160456 transitions. [2022-12-13 18:38:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:38:37,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:38:37,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:38:37,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 18:38:38,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 18:38:38,009 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:38:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:38:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1181562832, now seen corresponding path program 1 times [2022-12-13 18:38:38,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:38:38,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228430664] [2022-12-13 18:38:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:38:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:38:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:38:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:38:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:38:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:38:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:38:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:38:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:38:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:38:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:38:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:38:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:38:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:38:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:38:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228430664] [2022-12-13 18:38:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228430664] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:38:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339101316] [2022-12-13 18:38:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:38:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:38:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:38:38,129 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:38:38,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 18:38:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:38:38,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:38:38,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:38:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:38:38,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:38:38,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339101316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:38:38,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:38:38,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:38:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037233342] [2022-12-13 18:38:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:38:38,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:38:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:38:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:38:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:38:38,354 INFO L87 Difference]: Start difference. First operand 124233 states and 160456 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:38:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:38:53,460 INFO L93 Difference]: Finished difference Result 164267 states and 213655 transitions. [2022-12-13 18:38:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:38:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2022-12-13 18:38:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:38:53,657 INFO L225 Difference]: With dead ends: 164267 [2022-12-13 18:38:53,657 INFO L226 Difference]: Without dead ends: 89334 [2022-12-13 18:38:53,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:38:53,753 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 400 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:38:53,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 545 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:38:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89334 states. [2022-12-13 18:39:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89334 to 85086. [2022-12-13 18:39:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85086 states, 74869 states have (on average 1.2303356529404694) internal successors, (92114), 75879 states have internal predecessors, (92114), 5007 states have call successors, (5007), 3919 states have call predecessors, (5007), 5208 states have return successors, (11106), 5295 states have call predecessors, (11106), 5004 states have call successors, (11106) [2022-12-13 18:39:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85086 states to 85086 states and 108227 transitions. [2022-12-13 18:39:08,305 INFO L78 Accepts]: Start accepts. Automaton has 85086 states and 108227 transitions. Word has length 192 [2022-12-13 18:39:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:39:08,305 INFO L495 AbstractCegarLoop]: Abstraction has 85086 states and 108227 transitions. [2022-12-13 18:39:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:39:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 85086 states and 108227 transitions. [2022-12-13 18:39:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:39:08,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:39:08,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:39:08,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 18:39:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 18:39:08,558 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:39:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:39:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 977521262, now seen corresponding path program 1 times [2022-12-13 18:39:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:39:08,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730457009] [2022-12-13 18:39:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:39:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:39:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:39:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:39:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:39:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:39:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:39:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:39:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:39:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:39:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:39:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:39:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730457009] [2022-12-13 18:39:08,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730457009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:39:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652077283] [2022-12-13 18:39:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:39:08,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:39:08,644 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:39:08,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 18:39:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:08,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:39:08,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:39:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:39:08,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:39:08,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652077283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:39:08,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:39:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:39:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689025181] [2022-12-13 18:39:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:39:08,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:39:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:39:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:39:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:39:08,824 INFO L87 Difference]: Start difference. First operand 85086 states and 108227 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:39:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:39:19,681 INFO L93 Difference]: Finished difference Result 120980 states and 154848 transitions. [2022-12-13 18:39:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:39:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2022-12-13 18:39:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:39:19,808 INFO L225 Difference]: With dead ends: 120980 [2022-12-13 18:39:19,808 INFO L226 Difference]: Without dead ends: 60757 [2022-12-13 18:39:19,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:39:19,875 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 396 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:39:19,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 538 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:39:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60757 states. [2022-12-13 18:39:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60757 to 60757. [2022-12-13 18:39:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60757 states, 53470 states have (on average 1.2164017205909856) internal successors, (65041), 54133 states have internal predecessors, (65041), 3609 states have call successors, (3609), 2809 states have call predecessors, (3609), 3676 states have return successors, (7824), 3818 states have call predecessors, (7824), 3606 states have call successors, (7824) [2022-12-13 18:39:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60757 states to 60757 states and 76474 transitions. [2022-12-13 18:39:30,237 INFO L78 Accepts]: Start accepts. Automaton has 60757 states and 76474 transitions. Word has length 192 [2022-12-13 18:39:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:39:30,237 INFO L495 AbstractCegarLoop]: Abstraction has 60757 states and 76474 transitions. [2022-12-13 18:39:30,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:39:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 60757 states and 76474 transitions. [2022-12-13 18:39:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:39:30,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:39:30,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:39:30,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 18:39:30,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 18:39:30,462 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:39:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:39:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -810348560, now seen corresponding path program 1 times [2022-12-13 18:39:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:39:30,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653298749] [2022-12-13 18:39:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:39:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:39:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:39:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:39:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:39:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:39:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:39:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:39:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:39:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:39:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:39:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:39:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653298749] [2022-12-13 18:39:30,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653298749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:39:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942382837] [2022-12-13 18:39:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:30,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:39:30,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:39:30,584 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:39:30,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 18:39:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:30,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:39:30,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:39:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:39:30,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:39:30,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942382837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:39:30,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:39:30,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:39:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948822043] [2022-12-13 18:39:30,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:39:30,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:39:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:39:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:39:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:39:30,719 INFO L87 Difference]: Start difference. First operand 60757 states and 76474 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:39:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:39:41,547 INFO L93 Difference]: Finished difference Result 119828 states and 151404 transitions. [2022-12-13 18:39:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:39:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 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 192 [2022-12-13 18:39:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:39:41,672 INFO L225 Difference]: With dead ends: 119828 [2022-12-13 18:39:41,672 INFO L226 Difference]: Without dead ends: 60685 [2022-12-13 18:39:41,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:39:41,737 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 391 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:39:41,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 533 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:39:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60685 states. [2022-12-13 18:39:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60685 to 60685. [2022-12-13 18:39:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60685 states, 53398 states have (on average 1.2043334956365408) internal successors, (64309), 54061 states have internal predecessors, (64309), 3609 states have call successors, (3609), 2809 states have call predecessors, (3609), 3676 states have return successors, (7824), 3818 states have call predecessors, (7824), 3606 states have call successors, (7824) [2022-12-13 18:39:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60685 states to 60685 states and 75742 transitions. [2022-12-13 18:39:52,313 INFO L78 Accepts]: Start accepts. Automaton has 60685 states and 75742 transitions. Word has length 192 [2022-12-13 18:39:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:39:52,314 INFO L495 AbstractCegarLoop]: Abstraction has 60685 states and 75742 transitions. [2022-12-13 18:39:52,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:39:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60685 states and 75742 transitions. [2022-12-13 18:39:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:39:52,338 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:39:52,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:39:52,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 18:39:52,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 18:39:52,540 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:39:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:39:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash -740700686, now seen corresponding path program 1 times [2022-12-13 18:39:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:39:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733861907] [2022-12-13 18:39:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:39:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:39:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:39:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:39:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:39:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:39:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:39:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:39:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:39:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:39:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:39:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:39:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:39:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733861907] [2022-12-13 18:39:52,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733861907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:39:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609285043] [2022-12-13 18:39:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:39:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:39:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:39:52,635 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:39:52,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 18:39:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:39:52,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:39:52,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:39:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-12-13 18:39:52,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:39:52,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609285043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:39:52,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:39:52,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:39:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357324674] [2022-12-13 18:39:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:39:52,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:39:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:39:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:39:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:39:52,746 INFO L87 Difference]: Start difference. First operand 60685 states and 75742 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:40:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:40:07,482 INFO L93 Difference]: Finished difference Result 134409 states and 171813 transitions. [2022-12-13 18:40:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:40:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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 192 [2022-12-13 18:40:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:40:07,664 INFO L225 Difference]: With dead ends: 134409 [2022-12-13 18:40:07,664 INFO L226 Difference]: Without dead ends: 75336 [2022-12-13 18:40:07,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:40:07,741 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 89 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:40:07,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1409 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:40:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75336 states. [2022-12-13 18:40:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75336 to 63048. [2022-12-13 18:40:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63048 states, 55592 states have (on average 1.1902791768599799) internal successors, (66170), 56427 states have internal predecessors, (66170), 3609 states have call successors, (3609), 2809 states have call predecessors, (3609), 3845 states have return successors, (8289), 3815 states have call predecessors, (8289), 3606 states have call successors, (8289) [2022-12-13 18:40:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63048 states to 63048 states and 78068 transitions. [2022-12-13 18:40:20,428 INFO L78 Accepts]: Start accepts. Automaton has 63048 states and 78068 transitions. Word has length 192 [2022-12-13 18:40:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:40:20,428 INFO L495 AbstractCegarLoop]: Abstraction has 63048 states and 78068 transitions. [2022-12-13 18:40:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:40:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63048 states and 78068 transitions. [2022-12-13 18:40:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:40:20,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:40:20,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:20,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 18:40:20,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 18:40:20,654 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:40:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1931607636, now seen corresponding path program 1 times [2022-12-13 18:40:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971682733] [2022-12-13 18:40:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:40:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:40:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:40:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:40:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:40:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:40:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:40:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:40:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:40:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:40:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:40:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 18:40:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971682733] [2022-12-13 18:40:20,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971682733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:40:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413260632] [2022-12-13 18:40:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:40:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:40:20,774 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:40:20,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 18:40:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:20,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:40:20,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:40:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 18:40:20,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:40:20,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413260632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:20,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:40:20,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:40:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697663886] [2022-12-13 18:40:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:20,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:40:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:40:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:40:20,888 INFO L87 Difference]: Start difference. First operand 63048 states and 78068 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:40:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:40:32,902 INFO L93 Difference]: Finished difference Result 124003 states and 156643 transitions. [2022-12-13 18:40:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:40:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 192 [2022-12-13 18:40:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:40:33,029 INFO L225 Difference]: With dead ends: 124003 [2022-12-13 18:40:33,029 INFO L226 Difference]: Without dead ends: 62567 [2022-12-13 18:40:33,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:40:33,104 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 49 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:40:33,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1382 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:40:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62567 states. [2022-12-13 18:40:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62567 to 61501. [2022-12-13 18:40:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61501 states, 54179 states have (on average 1.1715609368943687) internal successors, (63474), 54920 states have internal predecessors, (63474), 3609 states have call successors, (3609), 2809 states have call predecessors, (3609), 3711 states have return successors, (7179), 3775 states have call predecessors, (7179), 3606 states have call successors, (7179) [2022-12-13 18:40:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61501 states to 61501 states and 74262 transitions. [2022-12-13 18:40:45,450 INFO L78 Accepts]: Start accepts. Automaton has 61501 states and 74262 transitions. Word has length 192 [2022-12-13 18:40:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:40:45,450 INFO L495 AbstractCegarLoop]: Abstraction has 61501 states and 74262 transitions. [2022-12-13 18:40:45,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:40:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 61501 states and 74262 transitions. [2022-12-13 18:40:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:40:45,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:40:45,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:45,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 18:40:45,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 18:40:45,674 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:40:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1692792602, now seen corresponding path program 1 times [2022-12-13 18:40:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443677273] [2022-12-13 18:40:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:40:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:40:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:40:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:40:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:40:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:40:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:40:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:40:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:40:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:40:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-13 18:40:45,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:45,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443677273] [2022-12-13 18:40:45,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443677273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:40:45,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216252132] [2022-12-13 18:40:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:45,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:40:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:40:45,808 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:40:45,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 18:40:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:45,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:40:45,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:40:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 18:40:45,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:40:45,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216252132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:45,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:40:45,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:40:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739837895] [2022-12-13 18:40:45,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:45,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:40:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:40:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:40:45,916 INFO L87 Difference]: Start difference. First operand 61501 states and 74262 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:40:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:40:56,609 INFO L93 Difference]: Finished difference Result 102871 states and 125816 transitions. [2022-12-13 18:40:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:40:56,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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 192 [2022-12-13 18:40:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:40:56,693 INFO L225 Difference]: With dead ends: 102871 [2022-12-13 18:40:56,693 INFO L226 Difference]: Without dead ends: 42979 [2022-12-13 18:40:56,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:40:56,756 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 10 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:40:56,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1367 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:40:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42979 states. [2022-12-13 18:41:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42979 to 42799. [2022-12-13 18:41:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42799 states, 37810 states have (on average 1.1555408622057657) internal successors, (43691), 38247 states have internal predecessors, (43691), 2490 states have call successors, (2490), 1949 states have call predecessors, (2490), 2497 states have return successors, (4217), 2604 states have call predecessors, (4217), 2487 states have call successors, (4217) [2022-12-13 18:41:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42799 states to 42799 states and 50398 transitions. [2022-12-13 18:41:06,367 INFO L78 Accepts]: Start accepts. Automaton has 42799 states and 50398 transitions. Word has length 192 [2022-12-13 18:41:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:06,367 INFO L495 AbstractCegarLoop]: Abstraction has 42799 states and 50398 transitions. [2022-12-13 18:41:06,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 18:41:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42799 states and 50398 transitions. [2022-12-13 18:41:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-12-13 18:41:06,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:06,386 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:06,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 18:41:06,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 18:41:06,587 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:06,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:06,589 INFO L85 PathProgramCache]: Analyzing trace with hash -647730294, now seen corresponding path program 1 times [2022-12-13 18:41:06,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:06,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732863165] [2022-12-13 18:41:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:41:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:41:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:41:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:41:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:41:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:41:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 18:41:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 18:41:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-12-13 18:41:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 18:41:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-12-13 18:41:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732863165] [2022-12-13 18:41:06,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732863165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:06,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:41:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616677323] [2022-12-13 18:41:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:06,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:41:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:41:06,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:41:06,726 INFO L87 Difference]: Start difference. First operand 42799 states and 50398 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 18:41:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:15,461 INFO L93 Difference]: Finished difference Result 71482 states and 84369 transitions. [2022-12-13 18:41:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:41:15,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 233 [2022-12-13 18:41:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:15,525 INFO L225 Difference]: With dead ends: 71482 [2022-12-13 18:41:15,525 INFO L226 Difference]: Without dead ends: 36084 [2022-12-13 18:41:15,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:41:15,565 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 1376 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:15,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 868 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 18:41:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36084 states. [2022-12-13 18:41:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36084 to 33905. [2022-12-13 18:41:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33905 states, 29970 states have (on average 1.1581581581581581) internal successors, (34710), 30344 states have internal predecessors, (34710), 1920 states have call successors, (1920), 1499 states have call predecessors, (1920), 2013 states have return successors, (3476), 2063 states have call predecessors, (3476), 1917 states have call successors, (3476) [2022-12-13 18:41:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33905 states to 33905 states and 40106 transitions. [2022-12-13 18:41:22,743 INFO L78 Accepts]: Start accepts. Automaton has 33905 states and 40106 transitions. Word has length 233 [2022-12-13 18:41:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:22,744 INFO L495 AbstractCegarLoop]: Abstraction has 33905 states and 40106 transitions. [2022-12-13 18:41:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 4 states have internal predecessors, (128), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 18:41:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33905 states and 40106 transitions. [2022-12-13 18:41:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-12-13 18:41:22,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:22,758 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:22,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 18:41:22,758 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1441178864, now seen corresponding path program 1 times [2022-12-13 18:41:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:22,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701876865] [2022-12-13 18:41:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:41:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:41:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:41:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:41:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:41:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:41:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:41:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 18:41:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 18:41:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 18:41:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 18:41:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 18:41:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-12-13 18:41:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:41:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-12-13 18:41:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-12-13 18:41:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-12-13 18:41:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-12-13 18:41:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-12-13 18:41:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-12-13 18:41:22,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:22,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701876865] [2022-12-13 18:41:22,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701876865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:41:22,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645949637] [2022-12-13 18:41:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:22,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:41:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:41:22,829 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:41:22,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 18:41:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:22,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:41:22,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-13 18:41:22,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:41:22,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645949637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:22,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:41:22,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2022-12-13 18:41:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110874421] [2022-12-13 18:41:22,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:22,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:41:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:41:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:41:22,941 INFO L87 Difference]: Start difference. First operand 33905 states and 40106 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 18:41:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:29,741 INFO L93 Difference]: Finished difference Result 35378 states and 41889 transitions. [2022-12-13 18:41:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:41:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 252 [2022-12-13 18:41:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:29,792 INFO L225 Difference]: With dead ends: 35378 [2022-12-13 18:41:29,792 INFO L226 Difference]: Without dead ends: 33876 [2022-12-13 18:41:29,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:41:29,801 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 69 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:29,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 685 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:41:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33876 states. [2022-12-13 18:41:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33876 to 33871. [2022-12-13 18:41:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33871 states, 29940 states have (on average 1.1575818303273213) internal successors, (34658), 30314 states have internal predecessors, (34658), 1920 states have call successors, (1920), 1499 states have call predecessors, (1920), 2009 states have return successors, (3472), 2059 states have call predecessors, (3472), 1917 states have call successors, (3472) [2022-12-13 18:41:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33871 states to 33871 states and 40050 transitions. [2022-12-13 18:41:37,039 INFO L78 Accepts]: Start accepts. Automaton has 33871 states and 40050 transitions. Word has length 252 [2022-12-13 18:41:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:37,039 INFO L495 AbstractCegarLoop]: Abstraction has 33871 states and 40050 transitions. [2022-12-13 18:41:37,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 18:41:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33871 states and 40050 transitions. [2022-12-13 18:41:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-12-13 18:41:37,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:37,053 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:37,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 18:41:37,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:41:37,254 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2031534197, now seen corresponding path program 1 times [2022-12-13 18:41:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601307995] [2022-12-13 18:41:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:37,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:41:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:41:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:41:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:41:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:41:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:41:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:41:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 18:41:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 18:41:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 18:41:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 18:41:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 18:41:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-12-13 18:41:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:41:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 18:41:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 18:41:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:41:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:41:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 18:41:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-12-13 18:41:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 18:41:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-12-13 18:41:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:37,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601307995] [2022-12-13 18:41:37,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601307995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:41:37,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117148587] [2022-12-13 18:41:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:37,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:41:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:41:37,384 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:41:37,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 18:41:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:37,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:41:37,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 18:41:37,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:41:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-12-13 18:41:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117148587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:41:37,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 18:41:37,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-12-13 18:41:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187551843] [2022-12-13 18:41:37,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 18:41:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 18:41:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 18:41:37,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:41:37,691 INFO L87 Difference]: Start difference. First operand 33871 states and 40050 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 18:41:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:45,154 INFO L93 Difference]: Finished difference Result 34235 states and 40455 transitions. [2022-12-13 18:41:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:41:45,155 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2022-12-13 18:41:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:45,210 INFO L225 Difference]: With dead ends: 34235 [2022-12-13 18:41:45,210 INFO L226 Difference]: Without dead ends: 32309 [2022-12-13 18:41:45,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 549 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:41:45,221 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 412 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 18:41:45,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1119 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 18:41:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32309 states. [2022-12-13 18:41:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32309 to 32309. [2022-12-13 18:41:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32309 states, 28693 states have (on average 1.1577388213153035) internal successors, (33219), 29054 states have internal predecessors, (33219), 1766 states have call successors, (1766), 1369 states have call predecessors, (1766), 1849 states have return successors, (3242), 1887 states have call predecessors, (3242), 1764 states have call successors, (3242) [2022-12-13 18:41:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32309 states to 32309 states and 38227 transitions. [2022-12-13 18:41:52,568 INFO L78 Accepts]: Start accepts. Automaton has 32309 states and 38227 transitions. Word has length 253 [2022-12-13 18:41:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:41:52,568 INFO L495 AbstractCegarLoop]: Abstraction has 32309 states and 38227 transitions. [2022-12-13 18:41:52,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 18:41:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 32309 states and 38227 transitions. [2022-12-13 18:41:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-12-13 18:41:52,588 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:41:52,588 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:52,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 18:41:52,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:41:52,789 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:41:52,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 214354236, now seen corresponding path program 1 times [2022-12-13 18:41:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:52,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439497015] [2022-12-13 18:41:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:41:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:41:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:41:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:41:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:41:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:41:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 18:41:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 18:41:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 18:41:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 18:41:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:41:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 18:41:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2022-12-13 18:41:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439497015] [2022-12-13 18:41:52,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439497015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:41:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591827229] [2022-12-13 18:41:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:41:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:41:52,921 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:41:52,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 18:41:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:53,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:41:53,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:41:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-12-13 18:41:53,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:41:53,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591827229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:53,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:41:53,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:41:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469167978] [2022-12-13 18:41:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:53,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:41:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:41:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:41:53,066 INFO L87 Difference]: Start difference. First operand 32309 states and 38227 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:41:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:41:59,938 INFO L93 Difference]: Finished difference Result 59483 states and 71918 transitions. [2022-12-13 18:41:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:41:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 276 [2022-12-13 18:41:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:41:59,988 INFO L225 Difference]: With dead ends: 59483 [2022-12-13 18:41:59,988 INFO L226 Difference]: Without dead ends: 27548 [2022-12-13 18:42:00,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:42:00,027 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 163 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:00,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:42:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27548 states. [2022-12-13 18:42:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27548 to 19877. [2022-12-13 18:42:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19877 states, 17548 states have (on average 1.1261682242990654) internal successors, (19762), 17691 states have internal predecessors, (19762), 1206 states have call successors, (1206), 921 states have call predecessors, (1206), 1122 states have return successors, (1760), 1265 states have call predecessors, (1760), 1204 states have call successors, (1760) [2022-12-13 18:42:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19877 states to 19877 states and 22728 transitions. [2022-12-13 18:42:04,994 INFO L78 Accepts]: Start accepts. Automaton has 19877 states and 22728 transitions. Word has length 276 [2022-12-13 18:42:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:04,994 INFO L495 AbstractCegarLoop]: Abstraction has 19877 states and 22728 transitions. [2022-12-13 18:42:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:42:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19877 states and 22728 transitions. [2022-12-13 18:42:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-12-13 18:42:05,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:05,010 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:05,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 18:42:05,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:42:05,211 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1699192761, now seen corresponding path program 1 times [2022-12-13 18:42:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:05,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687077293] [2022-12-13 18:42:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:42:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:42:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:42:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:42:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:42:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:42:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 18:42:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 18:42:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 18:42:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 18:42:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 18:42:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-12-13 18:42:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687077293] [2022-12-13 18:42:05,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687077293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:42:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547343703] [2022-12-13 18:42:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:42:05,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:42:05,314 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:42:05,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 18:42:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:05,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:42:05,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-12-13 18:42:05,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:05,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547343703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:05,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:42:05,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:42:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486599401] [2022-12-13 18:42:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:05,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:42:05,432 INFO L87 Difference]: Start difference. First operand 19877 states and 22728 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:42:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:06,781 INFO L93 Difference]: Finished difference Result 24889 states and 28384 transitions. [2022-12-13 18:42:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:42:06,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 276 [2022-12-13 18:42:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:06,789 INFO L225 Difference]: With dead ends: 24889 [2022-12-13 18:42:06,790 INFO L226 Difference]: Without dead ends: 4770 [2022-12-13 18:42:06,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:42:06,807 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 162 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:06,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 494 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:42:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-12-13 18:42:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4770. [2022-12-13 18:42:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4179 states have (on average 1.0961952620244078) internal successors, (4581), 4199 states have internal predecessors, (4581), 338 states have call successors, (338), 237 states have call predecessors, (338), 252 states have return successors, (359), 334 states have call predecessors, (359), 336 states have call successors, (359) [2022-12-13 18:42:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 5278 transitions. [2022-12-13 18:42:07,638 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 5278 transitions. Word has length 276 [2022-12-13 18:42:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:07,638 INFO L495 AbstractCegarLoop]: Abstraction has 4770 states and 5278 transitions. [2022-12-13 18:42:07,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:42:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 5278 transitions. [2022-12-13 18:42:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-12-13 18:42:07,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:07,642 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:07,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 18:42:07,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 18:42:07,843 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 184914899, now seen corresponding path program 1 times [2022-12-13 18:42:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:07,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017555181] [2022-12-13 18:42:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:42:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:42:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:42:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:42:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:42:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:42:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:42:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 18:42:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 18:42:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-12-13 18:42:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 18:42:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 49 proven. 43 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-12-13 18:42:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:07,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017555181] [2022-12-13 18:42:07,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017555181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:42:07,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332706954] [2022-12-13 18:42:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:42:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:42:07,957 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:42:07,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 18:42:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:08,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:42:08,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-13 18:42:08,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:08,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332706954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:42:08,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 18:42:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110413480] [2022-12-13 18:42:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:08,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:08,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:08,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:08,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:08,082 INFO L87 Difference]: Start difference. First operand 4770 states and 5278 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:42:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:08,882 INFO L93 Difference]: Finished difference Result 7720 states and 8601 transitions. [2022-12-13 18:42:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:42:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 277 [2022-12-13 18:42:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:08,889 INFO L225 Difference]: With dead ends: 7720 [2022-12-13 18:42:08,889 INFO L226 Difference]: Without dead ends: 4770 [2022-12-13 18:42:08,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:08,893 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 156 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:08,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 492 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:42:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-12-13 18:42:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4770. [2022-12-13 18:42:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4179 states have (on average 1.0880593443407514) internal successors, (4547), 4199 states have internal predecessors, (4547), 338 states have call successors, (338), 237 states have call predecessors, (338), 252 states have return successors, (359), 334 states have call predecessors, (359), 336 states have call successors, (359) [2022-12-13 18:42:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 5244 transitions. [2022-12-13 18:42:09,691 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 5244 transitions. Word has length 277 [2022-12-13 18:42:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:09,691 INFO L495 AbstractCegarLoop]: Abstraction has 4770 states and 5244 transitions. [2022-12-13 18:42:09,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 18:42:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 5244 transitions. [2022-12-13 18:42:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-12-13 18:42:09,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:09,695 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:09,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 18:42:09,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:42:09,897 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -698056312, now seen corresponding path program 1 times [2022-12-13 18:42:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:09,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938554609] [2022-12-13 18:42:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:42:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:42:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:42:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:42:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:42:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:42:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:42:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:42:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 18:42:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 18:42:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 18:42:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 71 proven. 102 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-12-13 18:42:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938554609] [2022-12-13 18:42:10,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938554609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:42:10,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681373881] [2022-12-13 18:42:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:42:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:42:10,015 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:42:10,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 18:42:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:42:10,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 18:42:10,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:10,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681373881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:10,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:42:10,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 18:42:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900622510] [2022-12-13 18:42:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:10,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:10,188 INFO L87 Difference]: Start difference. First operand 4770 states and 5244 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:42:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:11,002 INFO L93 Difference]: Finished difference Result 8294 states and 9167 transitions. [2022-12-13 18:42:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:42:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 280 [2022-12-13 18:42:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:11,009 INFO L225 Difference]: With dead ends: 8294 [2022-12-13 18:42:11,009 INFO L226 Difference]: Without dead ends: 4770 [2022-12-13 18:42:11,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:11,013 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 123 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:11,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:42:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-12-13 18:42:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 4770. [2022-12-13 18:42:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4179 states have (on average 1.0794448432639387) internal successors, (4511), 4199 states have internal predecessors, (4511), 338 states have call successors, (338), 237 states have call predecessors, (338), 252 states have return successors, (359), 334 states have call predecessors, (359), 336 states have call successors, (359) [2022-12-13 18:42:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 5208 transitions. [2022-12-13 18:42:11,840 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 5208 transitions. Word has length 280 [2022-12-13 18:42:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:11,840 INFO L495 AbstractCegarLoop]: Abstraction has 4770 states and 5208 transitions. [2022-12-13 18:42:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 18:42:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 5208 transitions. [2022-12-13 18:42:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 18:42:11,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:11,844 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:11,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 18:42:12,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 18:42:12,045 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 390703402, now seen corresponding path program 1 times [2022-12-13 18:42:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:12,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155901830] [2022-12-13 18:42:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:42:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:42:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:42:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:42:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:42:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:42:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:42:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:42:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 18:42:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 18:42:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 18:42:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-12-13 18:42:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:12,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155901830] [2022-12-13 18:42:12,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155901830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:12,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:12,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:42:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235426623] [2022-12-13 18:42:12,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:12,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:42:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:12,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:42:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:42:12,225 INFO L87 Difference]: Start difference. First operand 4770 states and 5208 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-13 18:42:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:14,503 INFO L93 Difference]: Finished difference Result 5128 states and 5583 transitions. [2022-12-13 18:42:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 18:42:14,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 283 [2022-12-13 18:42:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:14,510 INFO L225 Difference]: With dead ends: 5128 [2022-12-13 18:42:14,510 INFO L226 Difference]: Without dead ends: 5125 [2022-12-13 18:42:14,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:42:14,512 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 1105 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:14,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1374 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 18:42:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2022-12-13 18:42:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 4323. [2022-12-13 18:42:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 3791 states have (on average 1.0770245317858085) internal successors, (4083), 3811 states have internal predecessors, (4083), 303 states have call successors, (303), 212 states have call predecessors, (303), 228 states have return successors, (326), 300 states have call predecessors, (326), 302 states have call successors, (326) [2022-12-13 18:42:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 4712 transitions. [2022-12-13 18:42:15,423 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 4712 transitions. Word has length 283 [2022-12-13 18:42:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:15,423 INFO L495 AbstractCegarLoop]: Abstraction has 4323 states and 4712 transitions. [2022-12-13 18:42:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 6 states have internal predecessors, (142), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-13 18:42:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 4712 transitions. [2022-12-13 18:42:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-12-13 18:42:15,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:15,427 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:15,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 18:42:15,427 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1466213266, now seen corresponding path program 1 times [2022-12-13 18:42:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932696443] [2022-12-13 18:42:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:42:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:42:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:42:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:42:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:42:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:42:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:42:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:42:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 18:42:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 18:42:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:42:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 18:42:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-12-13 18:42:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:15,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932696443] [2022-12-13 18:42:15,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932696443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:15,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:15,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:42:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893089257] [2022-12-13 18:42:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:15,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:42:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:42:15,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:42:15,512 INFO L87 Difference]: Start difference. First operand 4323 states and 4712 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:42:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:42:16,923 INFO L93 Difference]: Finished difference Result 6306 states and 6952 transitions. [2022-12-13 18:42:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:42:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 287 [2022-12-13 18:42:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:42:16,930 INFO L225 Difference]: With dead ends: 6306 [2022-12-13 18:42:16,930 INFO L226 Difference]: Without dead ends: 4906 [2022-12-13 18:42:16,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:16,932 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 250 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:42:16,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 619 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:42:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2022-12-13 18:42:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4325. [2022-12-13 18:42:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 3793 states have (on average 1.0769839177432112) internal successors, (4085), 3813 states have internal predecessors, (4085), 303 states have call successors, (303), 212 states have call predecessors, (303), 228 states have return successors, (326), 300 states have call predecessors, (326), 302 states have call successors, (326) [2022-12-13 18:42:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 4714 transitions. [2022-12-13 18:42:17,766 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 4714 transitions. Word has length 287 [2022-12-13 18:42:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:42:17,767 INFO L495 AbstractCegarLoop]: Abstraction has 4325 states and 4714 transitions. [2022-12-13 18:42:17,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 18:42:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 4714 transitions. [2022-12-13 18:42:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-12-13 18:42:17,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:42:17,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 18:42:17,770 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:42:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -563040702, now seen corresponding path program 1 times [2022-12-13 18:42:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:17,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961091900] [2022-12-13 18:42:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:42:17,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:42:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:42:17,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:42:17,886 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:42:17,887 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 18:42:17,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 18:42:17,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 18:42:17,891 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:17,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:42:18,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:42:18 BoogieIcfgContainer [2022-12-13 18:42:18,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:42:18,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:42:18,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:42:18,021 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:42:18,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:33:39" (3/4) ... [2022-12-13 18:42:18,023 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:42:18,154 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:42:18,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:42:18,154 INFO L158 Benchmark]: Toolchain (without parser) took 519214.53ms. Allocated memory was 132.1MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 90.5MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.90ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 71.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 132.1MB. Free memory was 71.6MB in the beginning and 68.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: Boogie Preprocessor took 28.12ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: RCFGBuilder took 586.99ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 65.7MB in the beginning and 120.9MB in the end (delta: -55.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: TraceAbstraction took 518113.18ms. Allocated memory was 159.4MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 120.0MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 994.3MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,155 INFO L158 Benchmark]: Witness Printer took 132.96ms. Allocated memory is still 6.4GB. Free memory was 5.4GB in the beginning and 5.4GB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 18:42:18,156 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.90ms. Allocated memory is still 132.1MB. Free memory was 90.1MB in the beginning and 71.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 132.1MB. Free memory was 71.6MB in the beginning and 68.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.12ms. Allocated memory is still 132.1MB. Free memory was 68.7MB in the beginning and 65.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 586.99ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 65.7MB in the beginning and 120.9MB in the end (delta: -55.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 518113.18ms. Allocated memory was 159.4MB in the beginning and 6.4GB in the end (delta: 6.3GB). Free memory was 120.0MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 994.3MB. Max. memory is 16.1GB. * Witness Printer took 132.96ms. Allocated memory is still 6.4GB. Free memory was 5.4GB in the beginning and 5.4GB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1224] COND FALSE !(__VERIFIER_nondet_int()) [L1227] CALL main2() [L1211] int __retres1 ; [L1215] CALL init_model2() [L1124] m_i = 1 [L1125] t1_i = 1 [L1126] t2_i = 1 [L1127] t3_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1215] RET init_model2() [L1216] CALL start_simulation2() [L1152] int kernel_st ; [L1153] int tmp ; [L1154] int tmp___0 ; [L1158] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1159] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1160] CALL init_threads2() [L780] COND TRUE m_i == 1 [L781] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L785] COND TRUE t1_i == 1 [L786] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L790] COND TRUE t2_i == 1 [L791] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L795] COND TRUE t3_i == 1 [L796] t3_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1160] RET init_threads2() [L1161] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L917] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L922] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L927] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L932] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L937] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L942] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L947] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L952] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1161] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1162] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L696] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L706] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L708] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L715] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L727] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L734] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L746] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L753] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L763] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L765] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L1162] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1163] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L965] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L970] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L975] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L980] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L985] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L990] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L995] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1000] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1163] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1166] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1169] kernel_st = 1 [L1170] CALL eval2() [L836] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L864] COND TRUE t1_st == 0 [L865] int tmp_ndt_2; [L866] tmp_ndt_2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp_ndt_2) [L869] t1_st = 1 [L870] CALL transmit1() [L588] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L599] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L601] t1_pc = 1 [L602] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L870] RET transmit1() [L878] COND TRUE t2_st == 0 [L879] int tmp_ndt_3; [L880] tmp_ndt_3 = __VERIFIER_nondet_int() [L881] COND TRUE \read(tmp_ndt_3) [L883] t2_st = 1 [L884] CALL transmit2() [L624] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L635] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L637] t2_pc = 1 [L638] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L884] RET transmit2() [L892] COND TRUE t3_st == 0 [L893] int tmp_ndt_4; [L894] tmp_ndt_4 = __VERIFIER_nondet_int() [L895] COND TRUE \read(tmp_ndt_4) [L897] t3_st = 1 [L898] CALL transmit3() [L660] COND TRUE t3_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L671] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L673] t3_pc = 1 [L674] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L898] RET transmit3() [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-1, token=0] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND TRUE \read(tmp_ndt_1) [L855] m_st = 1 [L856] CALL master() [L530] int tmp_var = __VERIFIER_nondet_int(); [L532] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L543] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L546] token = __VERIFIER_nondet_int() [L547] local = token [L548] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L549] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1057] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L696] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L706] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L708] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L716] COND TRUE E_1 == 1 [L717] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L727] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND TRUE \read(tmp___0) [L1028] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L746] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L763] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L765] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L1057] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L550] E_1 = 2 [L551] m_pc = 1 [L552] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L856] RET master() [L864] COND TRUE t1_st == 0 [L865] int tmp_ndt_2; [L866] tmp_ndt_2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp_ndt_2) [L869] t1_st = 1 [L870] CALL transmit1() [L588] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L591] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L607] token += 1 [L608] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L609] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L697] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L706] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L735] COND TRUE E_2 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND TRUE \read(tmp___1) [L1036] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L763] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L609] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L610] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L599] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L601] t1_pc = 1 [L602] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L870] RET transmit1() [L878] COND TRUE t2_st == 0 [L879] int tmp_ndt_3; [L880] tmp_ndt_3 = __VERIFIER_nondet_int() [L881] COND TRUE \read(tmp_ndt_3) [L883] t2_st = 1 [L884] CALL transmit2() [L624] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L627] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L643] token += 1 [L644] E_3 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L645] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L697] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L706] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L754] COND TRUE E_3 == 1 [L755] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND TRUE \read(tmp___2) [L1044] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L645] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L646] E_3 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L635] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L637] t2_pc = 1 [L638] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L884] RET transmit2() [L892] COND TRUE t3_st == 0 [L893] int tmp_ndt_4; [L894] tmp_ndt_4 = __VERIFIER_nondet_int() [L895] COND TRUE \read(tmp_ndt_4) [L897] t3_st = 1 [L898] CALL transmit3() [L660] COND FALSE !(t3_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L663] COND TRUE t3_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L679] token += 1 [L680] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L681] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1057] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1010] int tmp ; [L1011] int tmp___0 ; [L1012] int tmp___1 ; [L1013] int tmp___2 ; [L1017] CALL, EXPR is_master_triggered() [L693] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L696] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L697] COND TRUE E_M == 1 [L698] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L708] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1017] RET, EXPR is_master_triggered() [L1017] tmp = is_master_triggered() [L1019] COND TRUE \read(tmp) [L1020] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L1025] CALL, EXPR is_transmit1_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L715] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L716] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L725] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L727] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1025] RET, EXPR is_transmit1_triggered() [L1025] tmp___0 = is_transmit1_triggered() [L1027] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L1033] CALL, EXPR is_transmit2_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L734] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L735] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L746] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1033] RET, EXPR is_transmit2_triggered() [L1033] tmp___1 = is_transmit2_triggered() [L1035] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L1041] CALL, EXPR is_transmit3_triggered() [L750] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L753] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L754] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L763] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L765] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1041] RET, EXPR is_transmit3_triggered() [L1041] tmp___2 = is_transmit3_triggered() [L1043] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L1057] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L681] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L682] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L671] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L673] t3_pc = 1 [L674] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L898] RET transmit3() [L840] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L843] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L805] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L808] COND TRUE m_st == 0 [L809] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L831] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L843] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L843] tmp = exists_runnable_thread2() [L845] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=-2, token=3] [L850] COND TRUE m_st == 0 [L851] int tmp_ndt_1; [L852] tmp_ndt_1 = __VERIFIER_nondet_int() [L853] COND TRUE \read(tmp_ndt_1) [L855] m_st = 1 [L856] CALL master() [L530] int tmp_var = __VERIFIER_nondet_int(); [L532] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L535] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L557] COND FALSE !(token != local + 3) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L568] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L569] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L570] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L571] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 266 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 517.9s, OverallIterations: 59, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.1s, AutomataDifference: 269.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32439 SdHoareTripleChecker+Valid, 19.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31716 mSDsluCounter, 50435 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33330 mSDsCounter, 4946 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30899 IncrementalHoareTripleChecker+Invalid, 35845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4946 mSolverCounterUnsat, 17105 mSDtfsCounter, 30899 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8033 GetRequests, 7395 SyntacticMatches, 19 SemanticMatches, 619 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124233occurred in iteration=43, InterpolantAutomatonStates: 523, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 230.4s AutomataMinimizationTime, 58 MinimizatonAttempts, 75782 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 14610 NumberOfCodeBlocks, 14610 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 14721 ConstructedInterpolants, 0 QuantifiedInterpolants, 26271 SizeOfPredicates, 13 NumberOfNonLiveVariables, 19369 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 90 InterpolantComputations, 55 PerfectInterpolantSequences, 9528/10289 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 18:42:18,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_044ef14f-0ea0-4f89-ac00-e0f280acdf38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE