./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS --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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- 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-4e7fbc6 [2022-11-23 03:31:31,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:31:31,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:31:31,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:31:31,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:31:31,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:31:31,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:31:31,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:31:31,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:31:31,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:31:31,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:31:31,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:31:31,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:31:31,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:31:31,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:31:31,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:31:31,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:31:31,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:31:31,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:31:31,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:31:31,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:31:31,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:31:31,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:31:31,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:31:31,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:31:31,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:31:31,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:31:31,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:31:31,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:31:31,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:31:31,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:31:31,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:31:31,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:31:31,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:31:31,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:31:31,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:31:31,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:31:31,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:31:31,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:31:31,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:31:31,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:31:31,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:31:31,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:31:31,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:31:31,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:31:31,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:31:31,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:31:31,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:31:31,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:31:31,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:31:31,605 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:31:31,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:31:31,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:31:31,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:31:31,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:31:31,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:31:31,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:31:31,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:31:31,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:31:31,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:31:31,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:31:31,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:31:31,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:31:31,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:31:31,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:31:31,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:31:31,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:31:31,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:31:31,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:31:31,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:31:31,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:31:31,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:31:31,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:31:31,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:31:31,613 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:31:31,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:31:31,614 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2022-11-23 03:31:31,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:31:32,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:31:32,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:31:32,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:31:32,032 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:31:32,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-23 03:31:35,659 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:31:35,958 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:31:35,959 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-23 03:31:35,970 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/data/488c56546/bf034288c9774bf4b48e41f7b0153090/FLAG29c4ec5a2 [2022-11-23 03:31:35,986 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/data/488c56546/bf034288c9774bf4b48e41f7b0153090 [2022-11-23 03:31:35,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:31:35,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:31:35,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:31:35,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:31:35,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:31:35,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:35" (1/1) ... [2022-11-23 03:31:36,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12876f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36, skipping insertion in model container [2022-11-23 03:31:36,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:35" (1/1) ... [2022-11-23 03:31:36,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:31:36,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:31:36,249 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-23 03:31:36,304 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-23 03:31:36,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:31:36,358 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:31:36,374 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-23 03:31:36,398 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_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-23 03:31:36,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:31:36,446 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:31:36,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36 WrapperNode [2022-11-23 03:31:36,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:31:36,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:31:36,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:31:36,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:31:36,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,510 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 422 [2022-11-23 03:31:36,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:31:36,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:31:36,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:31:36,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:31:36,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,550 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:31:36,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:31:36,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:31:36,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:31:36,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (1/1) ... [2022-11-23 03:31:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:31:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:36,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:31:36,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:31:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:31:36,695 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-23 03:31:36,695 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-23 03:31:36,695 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-23 03:31:36,695 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-23 03:31:36,695 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-23 03:31:36,696 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-23 03:31:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-23 03:31:36,696 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-23 03:31:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-23 03:31:36,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-23 03:31:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-23 03:31:36,697 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-23 03:31:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-23 03:31:36,697 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-23 03:31:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:31:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-23 03:31:36,698 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-23 03:31:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:31:36,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:31:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-23 03:31:36,698 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-23 03:31:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-23 03:31:36,699 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-23 03:31:36,819 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:31:36,822 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:31:37,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:31:37,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:31:37,681 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-23 03:31:37,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:37 BoogieIcfgContainer [2022-11-23 03:31:37,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:31:37,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:31:37,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:31:37,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:31:37,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:31:35" (1/3) ... [2022-11-23 03:31:37,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23677481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:37, skipping insertion in model container [2022-11-23 03:31:37,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:36" (2/3) ... [2022-11-23 03:31:37,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23677481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:37, skipping insertion in model container [2022-11-23 03:31:37,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:37" (3/3) ... [2022-11-23 03:31:37,708 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-23 03:31:37,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:31:37,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:31:37,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:31:37,866 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;@208b1833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:31:37,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 03:31:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-23 03:31:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 03:31:37,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:37,895 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] [2022-11-23 03:31:37,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash 578004893, now seen corresponding path program 1 times [2022-11-23 03:31:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:37,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083847722] [2022-11-23 03:31:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 03:31:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:38,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083847722] [2022-11-23 03:31:38,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083847722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:38,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:38,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:31:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139123230] [2022-11-23 03:31:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:38,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:38,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:31:38,483 INFO L87 Difference]: Start difference. First operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:38,983 INFO L93 Difference]: Finished difference Result 429 states and 652 transitions. [2022-11-23 03:31:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:31:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-11-23 03:31:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:39,001 INFO L225 Difference]: With dead ends: 429 [2022-11-23 03:31:39,002 INFO L226 Difference]: Without dead ends: 246 [2022-11-23 03:31:39,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:39,011 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 297 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:39,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 438 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:31:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-23 03:31:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2022-11-23 03:31:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.42) internal successors, (284), 205 states have internal predecessors, (284), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-11-23 03:31:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2022-11-23 03:31:39,160 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 44 [2022-11-23 03:31:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:39,162 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2022-11-23 03:31:39,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2022-11-23 03:31:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 03:31:39,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:39,170 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] [2022-11-23 03:31:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:31:39,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1000349205, now seen corresponding path program 1 times [2022-11-23 03:31:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009199625] [2022-11-23 03:31:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:31:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:39,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:39,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009199625] [2022-11-23 03:31:39,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009199625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:39,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:39,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:31:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231783678] [2022-11-23 03:31:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:39,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:31:39,377 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:39,768 INFO L93 Difference]: Finished difference Result 488 states and 680 transitions. [2022-11-23 03:31:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:31:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-23 03:31:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:39,780 INFO L225 Difference]: With dead ends: 488 [2022-11-23 03:31:39,780 INFO L226 Difference]: Without dead ends: 364 [2022-11-23 03:31:39,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:39,787 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 150 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:39,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 546 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:31:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-23 03:31:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2022-11-23 03:31:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 266 states have internal predecessors, (368), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-11-23 03:31:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2022-11-23 03:31:39,851 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 430 transitions. Word has length 45 [2022-11-23 03:31:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:39,852 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 430 transitions. [2022-11-23 03:31:39,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 430 transitions. [2022-11-23 03:31:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 03:31:39,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:39,867 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] [2022-11-23 03:31:39,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:31:39,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash -284008256, now seen corresponding path program 1 times [2022-11-23 03:31:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:39,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605893785] [2022-11-23 03:31:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 03:31:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:40,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:40,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605893785] [2022-11-23 03:31:40,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605893785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:40,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:40,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:31:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280294929] [2022-11-23 03:31:40,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:40,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:31:40,039 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:40,396 INFO L93 Difference]: Finished difference Result 715 states and 989 transitions. [2022-11-23 03:31:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:31:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-23 03:31:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:40,401 INFO L225 Difference]: With dead ends: 715 [2022-11-23 03:31:40,401 INFO L226 Difference]: Without dead ends: 524 [2022-11-23 03:31:40,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:40,405 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 306 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:40,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 428 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:31:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-23 03:31:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2022-11-23 03:31:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.371007371007371) internal successors, (558), 415 states have internal predecessors, (558), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-23 03:31:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 648 transitions. [2022-11-23 03:31:40,462 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 648 transitions. Word has length 45 [2022-11-23 03:31:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:40,462 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 648 transitions. [2022-11-23 03:31:40,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:31:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 648 transitions. [2022-11-23 03:31:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:31:40,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:40,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:40,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:31:40,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1712856217, now seen corresponding path program 1 times [2022-11-23 03:31:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:40,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117593523] [2022-11-23 03:31:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:40,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117593523] [2022-11-23 03:31:40,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117593523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:40,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:40,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:31:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806762464] [2022-11-23 03:31:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:31:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:31:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:40,572 INFO L87 Difference]: Start difference. First operand 472 states and 648 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:41,120 INFO L93 Difference]: Finished difference Result 596 states and 832 transitions. [2022-11-23 03:31:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:31:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-23 03:31:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:41,125 INFO L225 Difference]: With dead ends: 596 [2022-11-23 03:31:41,125 INFO L226 Difference]: Without dead ends: 493 [2022-11-23 03:31:41,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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-11-23 03:31:41,128 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 285 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 465 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:31:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-11-23 03:31:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2022-11-23 03:31:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 415 states have internal predecessors, (557), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-23 03:31:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 647 transitions. [2022-11-23 03:31:41,193 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 647 transitions. Word has length 58 [2022-11-23 03:31:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:41,194 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 647 transitions. [2022-11-23 03:31:41,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-11-23 03:31:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:31:41,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:41,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:41,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:31:41,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1231775959, now seen corresponding path program 1 times [2022-11-23 03:31:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:41,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565794227] [2022-11-23 03:31:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:41,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565794227] [2022-11-23 03:31:41,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565794227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:41,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:41,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:31:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428021451] [2022-11-23 03:31:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:41,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:31:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:31:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:31:41,386 INFO L87 Difference]: Start difference. First operand 472 states and 647 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:42,318 INFO L93 Difference]: Finished difference Result 710 states and 998 transitions. [2022-11-23 03:31:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:31:42,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-23 03:31:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:42,324 INFO L225 Difference]: With dead ends: 710 [2022-11-23 03:31:42,324 INFO L226 Difference]: Without dead ends: 610 [2022-11-23 03:31:42,325 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-11-23 03:31:42,327 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 458 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:42,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 628 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 03:31:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-23 03:31:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 567. [2022-11-23 03:31:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 485 states have (on average 1.3855670103092783) internal successors, (672), 494 states have internal predecessors, (672), 51 states have call successors, (51), 28 states have call predecessors, (51), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-23 03:31:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 785 transitions. [2022-11-23 03:31:42,406 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 785 transitions. Word has length 58 [2022-11-23 03:31:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:42,407 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 785 transitions. [2022-11-23 03:31:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 785 transitions. [2022-11-23 03:31:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:31:42,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:42,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:31:42,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 696496743, now seen corresponding path program 1 times [2022-11-23 03:31:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:42,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323132356] [2022-11-23 03:31:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:42,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323132356] [2022-11-23 03:31:42,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323132356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:42,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:42,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:31:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379383348] [2022-11-23 03:31:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:42,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:31:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:31:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:42,625 INFO L87 Difference]: Start difference. First operand 567 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:43,755 INFO L93 Difference]: Finished difference Result 918 states and 1293 transitions. [2022-11-23 03:31:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 03:31:43,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-23 03:31:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:43,763 INFO L225 Difference]: With dead ends: 918 [2022-11-23 03:31:43,764 INFO L226 Difference]: Without dead ends: 723 [2022-11-23 03:31:43,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:31:43,769 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 455 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:43,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1000 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 03:31:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-23 03:31:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 657. [2022-11-23 03:31:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 558 states have (on average 1.39247311827957) internal successors, (777), 568 states have internal predecessors, (777), 61 states have call successors, (61), 34 states have call predecessors, (61), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-11-23 03:31:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 912 transitions. [2022-11-23 03:31:43,875 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 912 transitions. Word has length 58 [2022-11-23 03:31:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:43,876 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 912 transitions. [2022-11-23 03:31:43,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 912 transitions. [2022-11-23 03:31:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:31:43,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:43,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:43,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:31:43,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1589983081, now seen corresponding path program 1 times [2022-11-23 03:31:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788840616] [2022-11-23 03:31:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:44,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-11-23 03:31:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:44,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788840616] [2022-11-23 03:31:44,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788840616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:44,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:44,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:31:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595990400] [2022-11-23 03:31:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:44,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:31:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:31:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:44,093 INFO L87 Difference]: Start difference. First operand 657 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:45,290 INFO L93 Difference]: Finished difference Result 1244 states and 1756 transitions. [2022-11-23 03:31:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:31:45,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-23 03:31:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:45,297 INFO L225 Difference]: With dead ends: 1244 [2022-11-23 03:31:45,297 INFO L226 Difference]: Without dead ends: 959 [2022-11-23 03:31:45,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:31:45,300 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 448 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:45,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 984 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 03:31:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-11-23 03:31:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 815. [2022-11-23 03:31:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 684 states have (on average 1.394736842105263) internal successors, (954), 696 states have internal predecessors, (954), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-11-23 03:31:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1133 transitions. [2022-11-23 03:31:45,402 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1133 transitions. Word has length 58 [2022-11-23 03:31:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1133 transitions. [2022-11-23 03:31:45,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1133 transitions. [2022-11-23 03:31:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:31:45,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:45,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:45,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:31:45,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 692589803, now seen corresponding path program 1 times [2022-11-23 03:31:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575902629] [2022-11-23 03:31:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:45,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575902629] [2022-11-23 03:31:45,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575902629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:45,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:45,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:31:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930693008] [2022-11-23 03:31:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:45,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:31:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:45,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:31:45,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:31:45,555 INFO L87 Difference]: Start difference. First operand 815 states and 1133 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:46,529 INFO L93 Difference]: Finished difference Result 1642 states and 2326 transitions. [2022-11-23 03:31:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:31:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-23 03:31:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:46,538 INFO L225 Difference]: With dead ends: 1642 [2022-11-23 03:31:46,538 INFO L226 Difference]: Without dead ends: 1200 [2022-11-23 03:31:46,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-23 03:31:46,542 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 562 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:46,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 715 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 03:31:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-11-23 03:31:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1067. [2022-11-23 03:31:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 885 states have (on average 1.3887005649717514) internal successors, (1229), 902 states have internal predecessors, (1229), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2022-11-23 03:31:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1474 transitions. [2022-11-23 03:31:46,690 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1474 transitions. Word has length 58 [2022-11-23 03:31:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:46,691 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1474 transitions. [2022-11-23 03:31:46,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-23 03:31:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1474 transitions. [2022-11-23 03:31:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:31:46,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:46,694 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] [2022-11-23 03:31:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:31:46,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 228372173, now seen corresponding path program 1 times [2022-11-23 03:31:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:46,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119001471] [2022-11-23 03:31:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:46,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-23 03:31:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:31:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119001471] [2022-11-23 03:31:46,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119001471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:46,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:46,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:31:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433709158] [2022-11-23 03:31:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:46,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:31:46,766 INFO L87 Difference]: Start difference. First operand 1067 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:31:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:47,160 INFO L93 Difference]: Finished difference Result 1651 states and 2259 transitions. [2022-11-23 03:31:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:31:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-11-23 03:31:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:47,168 INFO L225 Difference]: With dead ends: 1651 [2022-11-23 03:31:47,169 INFO L226 Difference]: Without dead ends: 1295 [2022-11-23 03:31:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:47,172 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 134 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 595 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:31:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-23 03:31:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1257. [2022-11-23 03:31:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1051 states have (on average 1.3596574690770695) internal successors, (1429), 1070 states have internal predecessors, (1429), 124 states have call successors, (124), 72 states have call predecessors, (124), 80 states have return successors, (159), 118 states have call predecessors, (159), 120 states have call successors, (159) [2022-11-23 03:31:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1712 transitions. [2022-11-23 03:31:47,320 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1712 transitions. Word has length 62 [2022-11-23 03:31:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:47,321 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1712 transitions. [2022-11-23 03:31:47,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:31:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1712 transitions. [2022-11-23 03:31:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 03:31:47,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:47,325 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] [2022-11-23 03:31:47,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:31:47,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash -387474386, now seen corresponding path program 1 times [2022-11-23 03:31:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:47,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286209508] [2022-11-23 03:31:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 03:31:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 03:31:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 03:31:47,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:47,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286209508] [2022-11-23 03:31:47,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286209508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:47,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:31:47,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:31:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090730835] [2022-11-23 03:31:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:47,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:31:47,397 INFO L87 Difference]: Start difference. First operand 1257 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 03:31:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:47,780 INFO L93 Difference]: Finished difference Result 1910 states and 2565 transitions. [2022-11-23 03:31:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:31:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-11-23 03:31:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:47,789 INFO L225 Difference]: With dead ends: 1910 [2022-11-23 03:31:47,789 INFO L226 Difference]: Without dead ends: 1456 [2022-11-23 03:31:47,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:31:47,792 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 292 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:47,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 424 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:31:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-11-23 03:31:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1401. [2022-11-23 03:31:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1179 states have (on average 1.3401187446988974) internal successors, (1580), 1200 states have internal predecessors, (1580), 132 states have call successors, (132), 78 states have call predecessors, (132), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-11-23 03:31:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1885 transitions. [2022-11-23 03:31:47,946 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1885 transitions. Word has length 67 [2022-11-23 03:31:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:47,947 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1885 transitions. [2022-11-23 03:31:47,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 03:31:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1885 transitions. [2022-11-23 03:31:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 03:31:47,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:47,959 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:31:47,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:31:47,959 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1207541004, now seen corresponding path program 1 times [2022-11-23 03:31:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288335450] [2022-11-23 03:31:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-23 03:31:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-23 03:31:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:31:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:48,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288335450] [2022-11-23 03:31:48,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288335450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:48,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85105997] [2022-11-23 03:31:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:48,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:48,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:48,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:31:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:48,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 03:31:48,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:48,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:31:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85105997] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:31:48,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-11-23 03:31:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276066095] [2022-11-23 03:31:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:31:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:31:48,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:48,592 INFO L87 Difference]: Start difference. First operand 1401 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:31:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:48,954 INFO L93 Difference]: Finished difference Result 1457 states and 1953 transitions. [2022-11-23 03:31:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:31:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-11-23 03:31:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:48,964 INFO L225 Difference]: With dead ends: 1457 [2022-11-23 03:31:48,965 INFO L226 Difference]: Without dead ends: 1454 [2022-11-23 03:31:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:31:48,967 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 419 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:48,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 340 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:31:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-23 03:31:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1400. [2022-11-23 03:31:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1179 states have (on average 1.3384223918575064) internal successors, (1578), 1199 states have internal predecessors, (1578), 131 states have call successors, (131), 78 states have call predecessors, (131), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-11-23 03:31:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1882 transitions. [2022-11-23 03:31:49,246 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1882 transitions. Word has length 68 [2022-11-23 03:31:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:49,247 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1882 transitions. [2022-11-23 03:31:49,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 03:31:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1882 transitions. [2022-11-23 03:31:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-23 03:31:49,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:49,251 INFO L195 NwaCegarLoop]: trace histogram [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-11-23 03:31:49,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 03:31:49,463 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1220320753, now seen corresponding path program 1 times [2022-11-23 03:31:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260593845] [2022-11-23 03:31:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-23 03:31:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:49,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-23 03:31:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:31:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260593845] [2022-11-23 03:31:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260593845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015577081] [2022-11-23 03:31:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:49,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:49,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:31:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:49,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 03:31:49,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:50,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:31:50,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015577081] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:31:50,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:31:50,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-11-23 03:31:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520130849] [2022-11-23 03:31:50,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:31:50,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:31:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:31:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:31:50,287 INFO L87 Difference]: Start difference. First operand 1400 states and 1882 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-23 03:31:52,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:52,152 INFO L93 Difference]: Finished difference Result 3100 states and 4102 transitions. [2022-11-23 03:31:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-23 03:31:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-11-23 03:31:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:52,165 INFO L225 Difference]: With dead ends: 3100 [2022-11-23 03:31:52,166 INFO L226 Difference]: Without dead ends: 2556 [2022-11-23 03:31:52,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-11-23 03:31:52,171 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 837 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:52,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1973 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 03:31:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-11-23 03:31:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2022-11-23 03:31:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1529 states have (on average 1.315892740353172) internal successors, (2012), 1557 states have internal predecessors, (2012), 151 states have call successors, (151), 92 states have call predecessors, (151), 107 states have return successors, (207), 143 states have call predecessors, (207), 148 states have call successors, (207) [2022-11-23 03:31:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2370 transitions. [2022-11-23 03:31:52,488 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2370 transitions. Word has length 69 [2022-11-23 03:31:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:52,489 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2370 transitions. [2022-11-23 03:31:52,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-23 03:31:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2370 transitions. [2022-11-23 03:31:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 03:31:52,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:52,495 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-23 03:31:52,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:52,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:52,702 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:52,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1470144615, now seen corresponding path program 1 times [2022-11-23 03:31:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:52,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281686232] [2022-11-23 03:31:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:52,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-23 03:31:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-23 03:31:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 03:31:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281686232] [2022-11-23 03:31:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281686232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81439397] [2022-11-23 03:31:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:52,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:52,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:52,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:31:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:52,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:31:53,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 03:31:53,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:53,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81439397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:53,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:53,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 03:31:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716002284] [2022-11-23 03:31:53,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:53,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:53,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:53,064 INFO L87 Difference]: Start difference. First operand 1789 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:31:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:53,372 INFO L93 Difference]: Finished difference Result 2512 states and 3308 transitions. [2022-11-23 03:31:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:53,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-11-23 03:31:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:53,384 INFO L225 Difference]: With dead ends: 2512 [2022-11-23 03:31:53,384 INFO L226 Difference]: Without dead ends: 1667 [2022-11-23 03:31:53,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:53,388 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 208 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:53,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-11-23 03:31:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1652. [2022-11-23 03:31:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1408 states have (on average 1.3167613636363635) internal successors, (1854), 1435 states have internal predecessors, (1854), 143 states have call successors, (143), 86 states have call predecessors, (143), 99 states have return successors, (193), 134 states have call predecessors, (193), 140 states have call successors, (193) [2022-11-23 03:31:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2190 transitions. [2022-11-23 03:31:53,637 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2190 transitions. Word has length 88 [2022-11-23 03:31:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:53,638 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 2190 transitions. [2022-11-23 03:31:53,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:31:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2190 transitions. [2022-11-23 03:31:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-23 03:31:53,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:53,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:53,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:53,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:53,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1819521257, now seen corresponding path program 1 times [2022-11-23 03:31:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:53,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814385578] [2022-11-23 03:31:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-23 03:31:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 03:31:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 03:31:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:54,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814385578] [2022-11-23 03:31:54,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814385578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:54,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529576487] [2022-11-23 03:31:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:54,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:54,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:31:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:54,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:31:54,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 03:31:54,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:54,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529576487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:54,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:54,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-23 03:31:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713896150] [2022-11-23 03:31:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:54,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:54,236 INFO L87 Difference]: Start difference. First operand 1652 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:31:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:54,489 INFO L93 Difference]: Finished difference Result 2176 states and 2945 transitions. [2022-11-23 03:31:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-11-23 03:31:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:54,501 INFO L225 Difference]: With dead ends: 2176 [2022-11-23 03:31:54,501 INFO L226 Difference]: Without dead ends: 1891 [2022-11-23 03:31:54,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:54,504 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 105 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:54,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 594 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-11-23 03:31:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-11-23 03:31:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1599 states have (on average 1.3258286429018136) internal successors, (2120), 1628 states have internal predecessors, (2120), 171 states have call successors, (171), 104 states have call predecessors, (171), 119 states have return successors, (235), 162 states have call predecessors, (235), 168 states have call successors, (235) [2022-11-23 03:31:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2526 transitions. [2022-11-23 03:31:54,801 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2526 transitions. Word has length 93 [2022-11-23 03:31:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:54,801 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2526 transitions. [2022-11-23 03:31:54,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:31:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2526 transitions. [2022-11-23 03:31:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-23 03:31:54,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:54,808 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-11-23 03:31:54,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 03:31:55,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1756250701, now seen corresponding path program 1 times [2022-11-23 03:31:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:55,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980323746] [2022-11-23 03:31:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-23 03:31:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-23 03:31:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-23 03:31:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-23 03:31:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-23 03:31:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 03:31:55,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:55,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980323746] [2022-11-23 03:31:55,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980323746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:55,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296106040] [2022-11-23 03:31:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:55,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:55,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:55,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:31:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:31:55,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 03:31:55,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:55,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296106040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:55,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:55,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 03:31:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999566995] [2022-11-23 03:31:55,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:55,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:55,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:55,344 INFO L87 Difference]: Start difference. First operand 1891 states and 2526 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-23 03:31:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:55,519 INFO L93 Difference]: Finished difference Result 2270 states and 2994 transitions. [2022-11-23 03:31:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-11-23 03:31:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:55,529 INFO L225 Difference]: With dead ends: 2270 [2022-11-23 03:31:55,529 INFO L226 Difference]: Without dead ends: 944 [2022-11-23 03:31:55,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:31:55,535 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 62 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 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-11-23 03:31:55,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-11-23 03:31:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2022-11-23 03:31:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 755 states have (on average 1.4066225165562913) internal successors, (1062), 768 states have internal predecessors, (1062), 114 states have call successors, (114), 67 states have call predecessors, (114), 74 states have return successors, (143), 112 states have call predecessors, (143), 112 states have call successors, (143) [2022-11-23 03:31:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1319 transitions. [2022-11-23 03:31:55,660 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1319 transitions. Word has length 103 [2022-11-23 03:31:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:55,661 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1319 transitions. [2022-11-23 03:31:55,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-23 03:31:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1319 transitions. [2022-11-23 03:31:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-23 03:31:55,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:55,666 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:31:55,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:55,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 03:31:55,873 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1396789480, now seen corresponding path program 1 times [2022-11-23 03:31:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488988810] [2022-11-23 03:31:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-23 03:31:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-23 03:31:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-23 03:31:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 03:31:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:56,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488988810] [2022-11-23 03:31:56,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488988810] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:56,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082910741] [2022-11-23 03:31:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:56,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:56,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:56,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:31:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:56,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:31:56,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 03:31:56,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082910741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:56,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:56,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-23 03:31:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158460663] [2022-11-23 03:31:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:56,444 INFO L87 Difference]: Start difference. First operand 944 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:31:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:56,749 INFO L93 Difference]: Finished difference Result 2739 states and 3855 transitions. [2022-11-23 03:31:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-23 03:31:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:56,760 INFO L225 Difference]: With dead ends: 2739 [2022-11-23 03:31:56,760 INFO L226 Difference]: Without dead ends: 1806 [2022-11-23 03:31:56,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:56,765 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 313 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-11-23 03:31:56,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-23 03:31:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1780. [2022-11-23 03:31:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.4055944055944056) internal successors, (2010), 1454 states have internal predecessors, (2010), 206 states have call successors, (206), 128 states have call predecessors, (206), 143 states have return successors, (257), 201 states have call predecessors, (257), 204 states have call successors, (257) [2022-11-23 03:31:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2473 transitions. [2022-11-23 03:31:57,023 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2473 transitions. Word has length 119 [2022-11-23 03:31:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:57,024 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 2473 transitions. [2022-11-23 03:31:57,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 03:31:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2473 transitions. [2022-11-23 03:31:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-23 03:31:57,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:57,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 03:31:57,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:57,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 03:31:57,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash -936187258, now seen corresponding path program 1 times [2022-11-23 03:31:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:57,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167653229] [2022-11-23 03:31:57,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-23 03:31:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-23 03:31:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-23 03:31:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-23 03:31:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-23 03:31:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:57,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167653229] [2022-11-23 03:31:57,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167653229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:57,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770709564] [2022-11-23 03:31:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:57,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:57,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:57,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:31:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:57,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:31:57,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-23 03:31:57,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:57,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770709564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:57,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:57,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-23 03:31:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606209934] [2022-11-23 03:31:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:57,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:57,647 INFO L87 Difference]: Start difference. First operand 1780 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-23 03:31:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:57,927 INFO L93 Difference]: Finished difference Result 3748 states and 5212 transitions. [2022-11-23 03:31:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 135 [2022-11-23 03:31:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:57,938 INFO L225 Difference]: With dead ends: 3748 [2022-11-23 03:31:57,938 INFO L226 Difference]: Without dead ends: 1980 [2022-11-23 03:31:57,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:57,944 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:57,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-11-23 03:31:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1962. [2022-11-23 03:31:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3652392947103276) internal successors, (2168), 1612 states have internal predecessors, (2168), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-11-23 03:31:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2661 transitions. [2022-11-23 03:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2661 transitions. Word has length 135 [2022-11-23 03:31:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:58,199 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2661 transitions. [2022-11-23 03:31:58,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-23 03:31:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2661 transitions. [2022-11-23 03:31:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-23 03:31:58,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:58,204 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, 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] [2022-11-23 03:31:58,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:58,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 03:31:58,412 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1173690117, now seen corresponding path program 1 times [2022-11-23 03:31:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:58,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035227087] [2022-11-23 03:31:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:31:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:31:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:31:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-23 03:31:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-23 03:31:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:58,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035227087] [2022-11-23 03:31:58,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035227087] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:58,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611163173] [2022-11-23 03:31:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:58,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:58,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 03:31:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:58,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:31:58,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 03:31:58,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:31:58,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611163173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:31:58,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:31:58,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-23 03:31:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711970895] [2022-11-23 03:31:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:31:58,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:31:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:31:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:58,856 INFO L87 Difference]: Start difference. First operand 1962 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (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-11-23 03:31:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:59,104 INFO L93 Difference]: Finished difference Result 3023 states and 4170 transitions. [2022-11-23 03:31:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:31:59,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (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 136 [2022-11-23 03:31:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:59,116 INFO L225 Difference]: With dead ends: 3023 [2022-11-23 03:31:59,116 INFO L226 Difference]: Without dead ends: 1988 [2022-11-23 03:31:59,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:31:59,121 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 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-11-23 03:31:59,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:31:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-11-23 03:31:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1962. [2022-11-23 03:31:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3406801007556675) internal successors, (2129), 1612 states have internal predecessors, (2129), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-11-23 03:31:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2622 transitions. [2022-11-23 03:31:59,525 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2622 transitions. Word has length 136 [2022-11-23 03:31:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:59,526 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2622 transitions. [2022-11-23 03:31:59,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (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-11-23 03:31:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2622 transitions. [2022-11-23 03:31:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-23 03:31:59,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:59,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:59,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:59,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 03:31:59,748 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:31:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -304816677, now seen corresponding path program 1 times [2022-11-23 03:31:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:59,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513099579] [2022-11-23 03:31:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:31:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:31:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:31:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:31:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:31:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:31:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:31:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-23 03:31:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-23 03:31:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513099579] [2022-11-23 03:31:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513099579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090739691] [2022-11-23 03:31:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:59,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:59,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:59,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 03:32:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:00,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 03:32:00,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 03:32:00,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:00,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090739691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:00,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:00,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-23 03:32:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654807238] [2022-11-23 03:32:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:00,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:32:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:00,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:32:00,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:32:00,172 INFO L87 Difference]: Start difference. First operand 1962 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 03:32:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:00,481 INFO L93 Difference]: Finished difference Result 3759 states and 5079 transitions. [2022-11-23 03:32:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:32:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2022-11-23 03:32:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:00,498 INFO L225 Difference]: With dead ends: 3759 [2022-11-23 03:32:00,498 INFO L226 Difference]: Without dead ends: 1938 [2022-11-23 03:32:00,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:32:00,504 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 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-11-23 03:32:00,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:32:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-11-23 03:32:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1798. [2022-11-23 03:32:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1455 states have (on average 1.2879725085910654) internal successors, (1874), 1475 states have internal predecessors, (1874), 196 states have call successors, (196), 135 states have call predecessors, (196), 146 states have return successors, (227), 189 states have call predecessors, (227), 194 states have call successors, (227) [2022-11-23 03:32:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2297 transitions. [2022-11-23 03:32:00,769 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2297 transitions. Word has length 136 [2022-11-23 03:32:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:00,770 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2297 transitions. [2022-11-23 03:32:00,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 03:32:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2297 transitions. [2022-11-23 03:32:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:32:00,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:00,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:00,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:00,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:00,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -829513402, now seen corresponding path program 1 times [2022-11-23 03:32:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937362450] [2022-11-23 03:32:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-23 03:32:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:01,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937362450] [2022-11-23 03:32:01,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937362450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:01,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266034071] [2022-11-23 03:32:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:01,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:01,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:01,183 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:01,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 03:32:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:01,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:32:01,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-23 03:32:01,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:01,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266034071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:01,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:01,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-23 03:32:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659002895] [2022-11-23 03:32:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:32:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:32:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:32:01,475 INFO L87 Difference]: Start difference. First operand 1798 states and 2297 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-23 03:32:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:01,895 INFO L93 Difference]: Finished difference Result 2932 states and 3786 transitions. [2022-11-23 03:32:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:32:01,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-23 03:32:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:01,919 INFO L225 Difference]: With dead ends: 2932 [2022-11-23 03:32:01,920 INFO L226 Difference]: Without dead ends: 1654 [2022-11-23 03:32:01,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:32:01,924 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 149 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:32:01,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 255 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:32:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-11-23 03:32:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1193. [2022-11-23 03:32:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 968 states have (on average 1.2572314049586777) internal successors, (1217), 980 states have internal predecessors, (1217), 131 states have call successors, (131), 88 states have call predecessors, (131), 93 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-11-23 03:32:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1493 transitions. [2022-11-23 03:32:02,130 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1493 transitions. Word has length 137 [2022-11-23 03:32:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:02,130 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1493 transitions. [2022-11-23 03:32:02,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-23 03:32:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1493 transitions. [2022-11-23 03:32:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:32:02,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:02,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:02,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:02,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:02,342 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1598745220, now seen corresponding path program 1 times [2022-11-23 03:32:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714574425] [2022-11-23 03:32:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-23 03:32:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714574425] [2022-11-23 03:32:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714574425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087493586] [2022-11-23 03:32:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:02,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:02,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:02,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:02,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 03:32:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:02,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:32:02,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-23 03:32:02,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087493586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:02,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:02,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-23 03:32:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469387370] [2022-11-23 03:32:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:02,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:32:02,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:32:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:32:02,813 INFO L87 Difference]: Start difference. First operand 1193 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-23 03:32:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:03,309 INFO L93 Difference]: Finished difference Result 2526 states and 3209 transitions. [2022-11-23 03:32:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:32:03,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-23 03:32:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:03,316 INFO L225 Difference]: With dead ends: 2526 [2022-11-23 03:32:03,316 INFO L226 Difference]: Without dead ends: 1343 [2022-11-23 03:32:03,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-23 03:32:03,321 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:32:03,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 249 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:32:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-23 03:32:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1287. [2022-11-23 03:32:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1056 states have (on average 1.2017045454545454) internal successors, (1269), 1068 states have internal predecessors, (1269), 131 states have call successors, (131), 94 states have call predecessors, (131), 99 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-11-23 03:32:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1545 transitions. [2022-11-23 03:32:03,541 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1545 transitions. Word has length 137 [2022-11-23 03:32:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:03,542 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1545 transitions. [2022-11-23 03:32:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-11-23 03:32:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1545 transitions. [2022-11-23 03:32:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:32:03,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:03,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:03,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:03,753 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 291602822, now seen corresponding path program 1 times [2022-11-23 03:32:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:03,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923613779] [2022-11-23 03:32:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-23 03:32:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923613779] [2022-11-23 03:32:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923613779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93308639] [2022-11-23 03:32:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:03,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:03,947 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:03,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 03:32:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:04,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:32:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-23 03:32:04,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:04,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93308639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:04,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:04,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-23 03:32:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743243891] [2022-11-23 03:32:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:04,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:32:04,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:32:04,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:32:04,164 INFO L87 Difference]: Start difference. First operand 1287 states and 1545 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-23 03:32:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:04,582 INFO L93 Difference]: Finished difference Result 2430 states and 2939 transitions. [2022-11-23 03:32:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:32:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-23 03:32:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:04,589 INFO L225 Difference]: With dead ends: 2430 [2022-11-23 03:32:04,590 INFO L226 Difference]: Without dead ends: 1154 [2022-11-23 03:32:04,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-11-23 03:32:04,597 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 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-11-23 03:32:04,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:32:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-23 03:32:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2022-11-23 03:32:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 919 states have (on average 1.1664853101196953) internal successors, (1072), 930 states have internal predecessors, (1072), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-23 03:32:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1305 transitions. [2022-11-23 03:32:04,903 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1305 transitions. Word has length 137 [2022-11-23 03:32:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:04,904 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 1305 transitions. [2022-11-23 03:32:04,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-11-23 03:32:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1305 transitions. [2022-11-23 03:32:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:32:04,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:04,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:04,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:05,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:05,115 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1015302262, now seen corresponding path program 1 times [2022-11-23 03:32:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:05,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425513936] [2022-11-23 03:32:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-23 03:32:05,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425513936] [2022-11-23 03:32:05,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425513936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:32:05,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586446527] [2022-11-23 03:32:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:05,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:32:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:32:05,297 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:32:05,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 03:32:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:05,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:32:05,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:32:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-23 03:32:05,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:32:05,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586446527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:05,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:32:05,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-23 03:32:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899071499] [2022-11-23 03:32:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:05,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:32:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:32:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:32:05,499 INFO L87 Difference]: Start difference. First operand 1118 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:32:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:05,772 INFO L93 Difference]: Finished difference Result 2253 states and 2674 transitions. [2022-11-23 03:32:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:32:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-23 03:32:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:05,778 INFO L225 Difference]: With dead ends: 2253 [2022-11-23 03:32:05,778 INFO L226 Difference]: Without dead ends: 1146 [2022-11-23 03:32:05,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 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-11-23 03:32:05,782 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 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-11-23 03:32:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:32:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-23 03:32:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1130. [2022-11-23 03:32:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 931 states have (on average 1.1417830290010742) internal successors, (1063), 942 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-23 03:32:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1296 transitions. [2022-11-23 03:32:06,005 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1296 transitions. Word has length 137 [2022-11-23 03:32:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:06,006 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1296 transitions. [2022-11-23 03:32:06,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:32:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1296 transitions. [2022-11-23 03:32:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-23 03:32:06,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:06,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:06,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 03:32:06,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 03:32:06,222 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1278353166, now seen corresponding path program 1 times [2022-11-23 03:32:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:06,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725985681] [2022-11-23 03:32:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-23 03:32:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:06,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725985681] [2022-11-23 03:32:06,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725985681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:06,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:32:06,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:32:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042873433] [2022-11-23 03:32:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:32:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:06,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:32:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:32:06,414 INFO L87 Difference]: Start difference. First operand 1130 states and 1296 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-23 03:32:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:07,444 INFO L93 Difference]: Finished difference Result 2094 states and 2378 transitions. [2022-11-23 03:32:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 03:32:07,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-23 03:32:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:07,452 INFO L225 Difference]: With dead ends: 2094 [2022-11-23 03:32:07,453 INFO L226 Difference]: Without dead ends: 2091 [2022-11-23 03:32:07,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-23 03:32:07,455 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 499 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:32:07,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 476 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:32:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-11-23 03:32:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1506. [2022-11-23 03:32:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1241 states have (on average 1.1402095084609185) internal successors, (1415), 1256 states have internal predecessors, (1415), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-23 03:32:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1724 transitions. [2022-11-23 03:32:07,781 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1724 transitions. Word has length 137 [2022-11-23 03:32:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:07,782 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1724 transitions. [2022-11-23 03:32:07,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-23 03:32:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1724 transitions. [2022-11-23 03:32:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-23 03:32:07,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:07,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:07,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 03:32:07,786 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1645790282, now seen corresponding path program 1 times [2022-11-23 03:32:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:07,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015762963] [2022-11-23 03:32:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-23 03:32:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 03:32:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:32:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:32:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-23 03:32:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 03:32:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 03:32:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 03:32:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-23 03:32:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-23 03:32:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:32:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-23 03:32:07,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:32:07,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015762963] [2022-11-23 03:32:07,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015762963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:32:07,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:32:07,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:32:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320111281] [2022-11-23 03:32:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:32:07,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:32:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:32:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:32:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:32:07,897 INFO L87 Difference]: Start difference. First operand 1506 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:32:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:32:08,600 INFO L93 Difference]: Finished difference Result 2729 states and 3212 transitions. [2022-11-23 03:32:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:32:08,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-23 03:32:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:32:08,621 INFO L225 Difference]: With dead ends: 2729 [2022-11-23 03:32:08,622 INFO L226 Difference]: Without dead ends: 1869 [2022-11-23 03:32:08,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:32:08,625 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:32:08,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 445 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:32:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-11-23 03:32:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1508. [2022-11-23 03:32:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1243 states have (on average 1.1399839098954143) internal successors, (1417), 1258 states have internal predecessors, (1417), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-23 03:32:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1726 transitions. [2022-11-23 03:32:08,942 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1726 transitions. Word has length 141 [2022-11-23 03:32:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:32:08,943 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 1726 transitions. [2022-11-23 03:32:08,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 03:32:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1726 transitions. [2022-11-23 03:32:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-23 03:32:08,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:32:08,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:08,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 03:32:08,947 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:32:08,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:32:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1749276047, now seen corresponding path program 1 times [2022-11-23 03:32:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:32:08,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618913566] [2022-11-23 03:32:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:32:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:32:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:32:08,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:32:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:32:09,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:32:09,071 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:32:09,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-23 03:32:09,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-23 03:32:09,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 03:32:09,082 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:32:09,088 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:32:09,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:32:09 BoogieIcfgContainer [2022-11-23 03:32:09,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:32:09,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:32:09,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:32:09,295 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:32:09,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:37" (3/4) ... [2022-11-23 03:32:09,298 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:32:09,492 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:32:09,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:32:09,493 INFO L158 Benchmark]: Toolchain (without parser) took 33501.51ms. Allocated memory was 163.6MB in the beginning and 633.3MB in the end (delta: 469.8MB). Free memory was 122.3MB in the beginning and 345.8MB in the end (delta: -223.5MB). Peak memory consumption was 248.5MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,494 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:32:09,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.72ms. Allocated memory is still 163.6MB. Free memory was 122.3MB in the beginning and 106.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.20ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 103.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,495 INFO L158 Benchmark]: Boogie Preprocessor took 45.60ms. Allocated memory is still 163.6MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,496 INFO L158 Benchmark]: RCFGBuilder took 1128.60ms. Allocated memory is still 163.6MB. Free memory was 101.4MB in the beginning and 76.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,499 INFO L158 Benchmark]: TraceAbstraction took 31603.54ms. Allocated memory was 163.6MB in the beginning and 633.3MB in the end (delta: 469.8MB). Free memory was 75.4MB in the beginning and 361.6MB in the end (delta: -286.2MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,500 INFO L158 Benchmark]: Witness Printer took 197.96ms. Allocated memory is still 633.3MB. Free memory was 361.6MB in the beginning and 345.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 03:32:09,515 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.35ms. Allocated memory is still 117.4MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.72ms. Allocated memory is still 163.6MB. Free memory was 122.3MB in the beginning and 106.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.20ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 103.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.60ms. Allocated memory is still 163.6MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1128.60ms. Allocated memory is still 163.6MB. Free memory was 101.4MB in the beginning and 76.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31603.54ms. Allocated memory was 163.6MB in the beginning and 633.3MB in the end (delta: 469.8MB). Free memory was 75.4MB in the beginning and 361.6MB in the end (delta: -286.2MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. * Witness Printer took 197.96ms. Allocated memory is still 633.3MB. Free memory was 361.6MB in the beginning and 345.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6661 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6463 mSDsluCounter, 13778 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8455 mSDsCounter, 827 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5716 IncrementalHoareTripleChecker+Invalid, 6543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 827 mSolverCounterUnsat, 5323 mSDtfsCounter, 5716 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 1996 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1962occurred in iteration=17, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 3176 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 3963 NumberOfCodeBlocks, 3963 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3918 ConstructedInterpolants, 0 QuantifiedInterpolants, 6561 SizeOfPredicates, 10 NumberOfNonLiveVariables, 5146 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 1572/1814 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-11-23 03:32:09,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26d2fd8b-e3b9-47df-9fb0-f60c322591d8/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE