./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa --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 586b4acd2b590d05e6c872ab286b63f1e9a66197df0a80de4a917f3d7db6c786 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:12:15,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:12:15,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:12:15,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:12:15,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:12:15,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:12:15,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:12:15,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:12:15,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:12:15,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:12:15,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:12:15,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:12:15,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:12:15,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:12:15,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:12:15,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:12:15,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:12:15,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:12:15,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:12:15,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:12:15,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:12:15,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:12:15,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:12:15,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:12:15,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:12:15,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:12:15,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:12:15,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:12:15,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:12:15,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:12:15,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:12:15,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:12:15,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:12:15,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:12:15,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:12:15,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:12:15,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:12:15,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:12:15,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:12:15,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:12:15,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:12:15,681 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:12:15,703 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:12:15,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:12:15,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:12:15,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:12:15,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:12:15,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:12:15,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:12:15,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:12:15,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:12:15,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:12:15,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:12:15,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:12:15,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:12:15,708 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:12:15,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:12:15,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:12:15,709 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:12:15,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/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_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa 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 -> 586b4acd2b590d05e6c872ab286b63f1e9a66197df0a80de4a917f3d7db6c786 [2021-12-06 22:12:15,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:12:15,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:12:15,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:12:15,920 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:12:15,921 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:12:15,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2021-12-06 22:12:15,964 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/data/c3127b09c/874a20816f184540a3a36c7b64005dd7/FLAG16e0ba779 [2021-12-06 22:12:16,370 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:12:16,370 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2021-12-06 22:12:16,377 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/data/c3127b09c/874a20816f184540a3a36c7b64005dd7/FLAG16e0ba779 [2021-12-06 22:12:16,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/data/c3127b09c/874a20816f184540a3a36c7b64005dd7 [2021-12-06 22:12:16,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:12:16,393 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:12:16,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:12:16,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:12:16,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:12:16,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6da8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16, skipping insertion in model container [2021-12-06 22:12:16,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:12:16,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:12:16,608 WARN L230 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_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2021-12-06 22:12:16,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:12:16,625 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:12:16,656 WARN L230 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_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c[6450,6463] [2021-12-06 22:12:16,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:12:16,670 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:12:16,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16 WrapperNode [2021-12-06 22:12:16,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:12:16,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:12:16,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:12:16,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:12:16,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,733 INFO L137 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 646 [2021-12-06 22:12:16,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:12:16,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:12:16,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:12:16,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:12:16,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:12:16,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:12:16,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:12:16,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:12:16,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (1/1) ... [2021-12-06 22:12:16,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:12:16,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:12:16,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:12:16,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:12:16,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:12:16,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 22:12:16,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 22:12:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 22:12:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-06 22:12:16,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-06 22:12:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-06 22:12:16,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-06 22:12:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-06 22:12:16,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-06 22:12:16,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:12:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 22:12:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:12:16,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:12:16,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 22:12:16,852 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 22:12:16,944 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:12:16,945 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:12:17,407 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:12:17,421 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:12:17,421 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-06 22:12:17,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:12:17 BoogieIcfgContainer [2021-12-06 22:12:17,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:12:17,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:12:17,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:12:17,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:12:17,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:12:16" (1/3) ... [2021-12-06 22:12:17,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3640d29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:12:17, skipping insertion in model container [2021-12-06 22:12:17,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:12:16" (2/3) ... [2021-12-06 22:12:17,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3640d29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:12:17, skipping insertion in model container [2021-12-06 22:12:17,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:12:17" (3/3) ... [2021-12-06 22:12:17,430 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2021-12-06 22:12:17,434 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 22:12:17,434 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:12:17,434 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 22:12:17,434 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 22:12:17,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,509 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,512 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,514 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,515 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,516 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,517 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,522 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,526 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,537 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,538 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,539 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,540 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,541 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,542 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,543 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,544 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,545 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,546 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,547 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,548 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,549 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,560 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,574 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,575 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,576 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,584 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,585 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,586 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,587 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,588 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,589 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,595 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,596 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,597 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,608 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,609 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,629 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem70#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite72#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem67#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite81#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem59#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem76#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem60#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,630 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite78#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short71#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem73#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret82#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite69#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short77#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem64#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,631 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post79#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short68#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem63#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite66#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite83#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret80#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,632 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite75#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~nondet58#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite62#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short74#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite84#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short61#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~short65#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 22:12:17,640 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-06 22:12:17,674 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:12:17,679 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 22:12:17,680 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-06 22:12:17,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 770 places, 851 transitions, 1726 flow [2021-12-06 22:12:17,965 INFO L129 PetriNetUnfolder]: 91/848 cut-off events. [2021-12-06 22:12:17,965 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 22:12:17,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 848 events. 91/848 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3044 event pairs, 0 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 622. Up to 2 conditions per place. [2021-12-06 22:12:17,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 770 places, 851 transitions, 1726 flow [2021-12-06 22:12:18,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 756 places, 837 transitions, 1692 flow [2021-12-06 22:12:18,242 INFO L129 PetriNetUnfolder]: 89/827 cut-off events. [2021-12-06 22:12:18,243 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 22:12:18,243 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:18,243 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:18,244 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1905717660, now seen corresponding path program 1 times [2021-12-06 22:12:18,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:18,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347145384] [2021-12-06 22:12:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:18,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:18,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:18,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347145384] [2021-12-06 22:12:18,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347145384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:18,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:18,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 22:12:18,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681623497] [2021-12-06 22:12:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:18,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 22:12:18,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 22:12:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 22:12:18,519 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 807 out of 851 [2021-12-06 22:12:18,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 837 transitions, 1692 flow. Second operand has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:18,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:18,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 807 of 851 [2021-12-06 22:12:18,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:18,864 INFO L129 PetriNetUnfolder]: 54/800 cut-off events. [2021-12-06 22:12:18,864 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2021-12-06 22:12:18,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 800 events. 54/800 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2980 event pairs, 0 based on Foata normal form. 60/775 useless extension candidates. Maximal degree in co-relation 597. Up to 7 conditions per place. [2021-12-06 22:12:18,896 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 6 selfloop transitions, 0 changer transitions 7/800 dead transitions. [2021-12-06 22:12:18,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 800 transitions, 1630 flow [2021-12-06 22:12:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 22:12:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-06 22:12:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1657 transitions. [2021-12-06 22:12:18,916 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9735605170387779 [2021-12-06 22:12:18,917 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1657 transitions. [2021-12-06 22:12:18,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1657 transitions. [2021-12-06 22:12:18,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:18,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1657 transitions. [2021-12-06 22:12:18,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 828.5) internal successors, (1657), 2 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:18,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:18,944 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 851.0) internal successors, (2553), 3 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:18,946 INFO L186 Difference]: Start difference. First operand has 756 places, 837 transitions, 1692 flow. Second operand 2 states and 1657 transitions. [2021-12-06 22:12:18,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 800 transitions, 1630 flow [2021-12-06 22:12:18,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 800 transitions, 1618 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-06 22:12:18,967 INFO L242 Difference]: Finished difference. Result has 751 places, 793 transitions, 1592 flow [2021-12-06 22:12:18,969 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=750, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=800, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1592, PETRI_PLACES=751, PETRI_TRANSITIONS=793} [2021-12-06 22:12:18,973 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2021-12-06 22:12:18,973 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 793 transitions, 1592 flow [2021-12-06 22:12:18,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 811.5) internal successors, (1623), 2 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:18,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:18,974 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:18,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:12:18,975 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1986224669, now seen corresponding path program 1 times [2021-12-06 22:12:18,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:18,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978464656] [2021-12-06 22:12:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:18,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:19,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:19,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978464656] [2021-12-06 22:12:19,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978464656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:19,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:19,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:19,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624562294] [2021-12-06 22:12:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:19,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:19,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:19,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:19,151 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:19,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 793 transitions, 1592 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:19,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:19,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:19,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:20,150 INFO L129 PetriNetUnfolder]: 352/3450 cut-off events. [2021-12-06 22:12:20,150 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-12-06 22:12:20,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 3450 events. 352/3450 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 30838 event pairs, 96 based on Foata normal form. 0/3062 useless extension candidates. Maximal degree in co-relation 3767. Up to 185 conditions per place. [2021-12-06 22:12:20,220 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 33 selfloop transitions, 2 changer transitions 0/808 dead transitions. [2021-12-06 22:12:20,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 746 places, 808 transitions, 1697 flow [2021-12-06 22:12:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2021-12-06 22:12:20,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2021-12-06 22:12:20,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2021-12-06 22:12:20,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2021-12-06 22:12:20,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:20,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2021-12-06 22:12:20,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:20,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:20,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:20,248 INFO L186 Difference]: Start difference. First operand has 751 places, 793 transitions, 1592 flow. Second operand 3 states and 2416 transitions. [2021-12-06 22:12:20,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 746 places, 808 transitions, 1697 flow [2021-12-06 22:12:20,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 746 places, 808 transitions, 1697 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 22:12:20,267 INFO L242 Difference]: Finished difference. Result has 748 places, 795 transitions, 1612 flow [2021-12-06 22:12:20,268 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=748, PETRI_TRANSITIONS=795} [2021-12-06 22:12:20,269 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -8 predicate places. [2021-12-06 22:12:20,270 INFO L470 AbstractCegarLoop]: Abstraction has has 748 places, 795 transitions, 1612 flow [2021-12-06 22:12:20,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:20,272 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:20,272 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:20,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:12:20,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1365782035, now seen corresponding path program 2 times [2021-12-06 22:12:20,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:20,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756498648] [2021-12-06 22:12:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:20,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:20,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:20,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756498648] [2021-12-06 22:12:20,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756498648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:20,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:20,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:20,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007339433] [2021-12-06 22:12:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:20,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:20,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:20,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:20,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 795 transitions, 1612 flow. Second operand has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:20,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:20,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:20,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:21,323 INFO L129 PetriNetUnfolder]: 378/3800 cut-off events. [2021-12-06 22:12:21,323 INFO L130 PetriNetUnfolder]: For 112/121 co-relation queries the response was YES. [2021-12-06 22:12:21,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 3800 events. 378/3800 cut-off events. For 112/121 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 34195 event pairs, 98 based on Foata normal form. 6/3425 useless extension candidates. Maximal degree in co-relation 4202. Up to 201 conditions per place. [2021-12-06 22:12:21,407 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 33 selfloop transitions, 4 changer transitions 0/810 dead transitions. [2021-12-06 22:12:21,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 750 places, 810 transitions, 1725 flow [2021-12-06 22:12:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2021-12-06 22:12:21,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2021-12-06 22:12:21,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2021-12-06 22:12:21,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2021-12-06 22:12:21,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:21,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2021-12-06 22:12:21,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:21,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:21,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:21,427 INFO L186 Difference]: Start difference. First operand has 748 places, 795 transitions, 1612 flow. Second operand 3 states and 2416 transitions. [2021-12-06 22:12:21,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 750 places, 810 transitions, 1725 flow [2021-12-06 22:12:21,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 810 transitions, 1723 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:21,440 INFO L242 Difference]: Finished difference. Result has 751 places, 797 transitions, 1642 flow [2021-12-06 22:12:21,442 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=747, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1642, PETRI_PLACES=751, PETRI_TRANSITIONS=797} [2021-12-06 22:12:21,442 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -5 predicate places. [2021-12-06 22:12:21,442 INFO L470 AbstractCegarLoop]: Abstraction has has 751 places, 797 transitions, 1642 flow [2021-12-06 22:12:21,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.0) internal successors, (2391), 3 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:21,444 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:21,444 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:21,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:12:21,445 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 360113765, now seen corresponding path program 1 times [2021-12-06 22:12:21,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:21,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480498296] [2021-12-06 22:12:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:21,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:21,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480498296] [2021-12-06 22:12:21,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480498296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:21,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:21,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:21,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037538178] [2021-12-06 22:12:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:21,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:21,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:21,555 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:21,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 751 places, 797 transitions, 1642 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:21,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:21,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:21,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:22,814 INFO L129 PetriNetUnfolder]: 789/6867 cut-off events. [2021-12-06 22:12:22,814 INFO L130 PetriNetUnfolder]: For 396/464 co-relation queries the response was YES. [2021-12-06 22:12:22,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7567 conditions, 6867 events. 789/6867 cut-off events. For 396/464 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 70955 event pairs, 210 based on Foata normal form. 4/6042 useless extension candidates. Maximal degree in co-relation 7561. Up to 390 conditions per place. [2021-12-06 22:12:22,913 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 32 selfloop transitions, 5 changer transitions 0/812 dead transitions. [2021-12-06 22:12:22,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 753 places, 812 transitions, 1757 flow [2021-12-06 22:12:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2021-12-06 22:12:22,918 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2021-12-06 22:12:22,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2021-12-06 22:12:22,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2021-12-06 22:12:22,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:22,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2021-12-06 22:12:22,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:22,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:22,931 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:22,931 INFO L186 Difference]: Start difference. First operand has 751 places, 797 transitions, 1642 flow. Second operand 3 states and 2415 transitions. [2021-12-06 22:12:22,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 753 places, 812 transitions, 1757 flow [2021-12-06 22:12:22,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 751 places, 812 transitions, 1745 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-06 22:12:22,948 INFO L242 Difference]: Finished difference. Result has 753 places, 800 transitions, 1675 flow [2021-12-06 22:12:22,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=749, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1675, PETRI_PLACES=753, PETRI_TRANSITIONS=800} [2021-12-06 22:12:22,950 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -3 predicate places. [2021-12-06 22:12:22,950 INFO L470 AbstractCegarLoop]: Abstraction has has 753 places, 800 transitions, 1675 flow [2021-12-06 22:12:22,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:22,952 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:22,952 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:22,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:12:22,952 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1778547265, now seen corresponding path program 2 times [2021-12-06 22:12:22,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:22,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458677209] [2021-12-06 22:12:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:22,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:23,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:23,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458677209] [2021-12-06 22:12:23,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458677209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:23,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:23,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:23,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773139415] [2021-12-06 22:12:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:23,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:23,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:23,015 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:23,018 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 800 transitions, 1675 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:23,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:23,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:23,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:24,183 INFO L129 PetriNetUnfolder]: 771/6975 cut-off events. [2021-12-06 22:12:24,183 INFO L130 PetriNetUnfolder]: For 566/636 co-relation queries the response was YES. [2021-12-06 22:12:24,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7788 conditions, 6975 events. 771/6975 cut-off events. For 566/636 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 72272 event pairs, 211 based on Foata normal form. 9/6203 useless extension candidates. Maximal degree in co-relation 7781. Up to 405 conditions per place. [2021-12-06 22:12:24,315 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 37 selfloop transitions, 3 changer transitions 0/815 dead transitions. [2021-12-06 22:12:24,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 755 places, 815 transitions, 1801 flow [2021-12-06 22:12:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2415 transitions. [2021-12-06 22:12:24,321 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9459459459459459 [2021-12-06 22:12:24,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2415 transitions. [2021-12-06 22:12:24,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2415 transitions. [2021-12-06 22:12:24,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:24,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2415 transitions. [2021-12-06 22:12:24,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.0) internal successors, (2415), 3 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:24,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:24,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:24,336 INFO L186 Difference]: Start difference. First operand has 753 places, 800 transitions, 1675 flow. Second operand 3 states and 2415 transitions. [2021-12-06 22:12:24,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 755 places, 815 transitions, 1801 flow [2021-12-06 22:12:24,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 753 places, 815 transitions, 1791 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 22:12:24,352 INFO L242 Difference]: Finished difference. Result has 755 places, 803 transitions, 1707 flow [2021-12-06 22:12:24,353 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=751, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1707, PETRI_PLACES=755, PETRI_TRANSITIONS=803} [2021-12-06 22:12:24,354 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, -1 predicate places. [2021-12-06 22:12:24,354 INFO L470 AbstractCegarLoop]: Abstraction has has 755 places, 803 transitions, 1707 flow [2021-12-06 22:12:24,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:24,355 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:24,355 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:24,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:12:24,356 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1706386129, now seen corresponding path program 1 times [2021-12-06 22:12:24,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165854517] [2021-12-06 22:12:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:24,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:24,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165854517] [2021-12-06 22:12:24,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165854517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:24,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:24,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:24,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800122160] [2021-12-06 22:12:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:24,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:24,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:24,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:24,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:24,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:24,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 755 places, 803 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:24,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:24,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:24,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:25,407 INFO L129 PetriNetUnfolder]: 296/3239 cut-off events. [2021-12-06 22:12:25,407 INFO L130 PetriNetUnfolder]: For 432/539 co-relation queries the response was YES. [2021-12-06 22:12:25,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 3239 events. 296/3239 cut-off events. For 432/539 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 29008 event pairs, 71 based on Foata normal form. 10/2970 useless extension candidates. Maximal degree in co-relation 3759. Up to 185 conditions per place. [2021-12-06 22:12:25,503 INFO L132 encePairwiseOnDemand]: 847/851 looper letters, 35 selfloop transitions, 4 changer transitions 0/818 dead transitions. [2021-12-06 22:12:25,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 818 transitions, 1828 flow [2021-12-06 22:12:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2021-12-06 22:12:25,509 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2021-12-06 22:12:25,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2021-12-06 22:12:25,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2021-12-06 22:12:25,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:25,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2021-12-06 22:12:25,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:25,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:25,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:25,519 INFO L186 Difference]: Start difference. First operand has 755 places, 803 transitions, 1707 flow. Second operand 3 states and 2416 transitions. [2021-12-06 22:12:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 818 transitions, 1828 flow [2021-12-06 22:12:25,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 756 places, 818 transitions, 1819 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:25,535 INFO L242 Difference]: Finished difference. Result has 758 places, 805 transitions, 1738 flow [2021-12-06 22:12:25,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1738, PETRI_PLACES=758, PETRI_TRANSITIONS=805} [2021-12-06 22:12:25,537 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 2 predicate places. [2021-12-06 22:12:25,537 INFO L470 AbstractCegarLoop]: Abstraction has has 758 places, 805 transitions, 1738 flow [2021-12-06 22:12:25,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:25,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:25,538 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:25,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:12:25,538 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2139301649, now seen corresponding path program 2 times [2021-12-06 22:12:25,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:25,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700518763] [2021-12-06 22:12:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:25,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:25,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:25,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700518763] [2021-12-06 22:12:25,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700518763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:25,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:25,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:25,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152398418] [2021-12-06 22:12:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:25,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:25,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:25,612 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 851 [2021-12-06 22:12:25,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 805 transitions, 1738 flow. Second operand has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:25,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:25,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 851 [2021-12-06 22:12:25,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:26,350 INFO L129 PetriNetUnfolder]: 259/2956 cut-off events. [2021-12-06 22:12:26,350 INFO L130 PetriNetUnfolder]: For 637/733 co-relation queries the response was YES. [2021-12-06 22:12:26,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 2956 events. 259/2956 cut-off events. For 637/733 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 25755 event pairs, 74 based on Foata normal form. 8/2722 useless extension candidates. Maximal degree in co-relation 3542. Up to 190 conditions per place. [2021-12-06 22:12:26,428 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 35 selfloop transitions, 6 changer transitions 0/818 dead transitions. [2021-12-06 22:12:26,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 760 places, 818 transitions, 1857 flow [2021-12-06 22:12:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2416 transitions. [2021-12-06 22:12:26,433 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9463376419898158 [2021-12-06 22:12:26,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2416 transitions. [2021-12-06 22:12:26,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2416 transitions. [2021-12-06 22:12:26,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:26,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2416 transitions. [2021-12-06 22:12:26,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 805.3333333333334) internal successors, (2416), 3 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,441 INFO L186 Difference]: Start difference. First operand has 758 places, 805 transitions, 1738 flow. Second operand 3 states and 2416 transitions. [2021-12-06 22:12:26,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 760 places, 818 transitions, 1857 flow [2021-12-06 22:12:26,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 818 transitions, 1853 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:26,455 INFO L242 Difference]: Finished difference. Result has 761 places, 805 transitions, 1776 flow [2021-12-06 22:12:26,456 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=757, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=761, PETRI_TRANSITIONS=805} [2021-12-06 22:12:26,457 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 5 predicate places. [2021-12-06 22:12:26,457 INFO L470 AbstractCegarLoop]: Abstraction has has 761 places, 805 transitions, 1776 flow [2021-12-06 22:12:26,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 797.3333333333334) internal successors, (2392), 3 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:26,458 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:26,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:12:26,458 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1541370568, now seen corresponding path program 1 times [2021-12-06 22:12:26,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:26,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408755220] [2021-12-06 22:12:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:26,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:12:26,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408755220] [2021-12-06 22:12:26,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408755220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:26,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:26,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:12:26,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43730607] [2021-12-06 22:12:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:26,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:12:26,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:26,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:12:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:12:26,535 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 774 out of 851 [2021-12-06 22:12:26,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 805 transitions, 1776 flow. Second operand has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:26,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 774 of 851 [2021-12-06 22:12:26,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:26,815 INFO L129 PetriNetUnfolder]: 54/1036 cut-off events. [2021-12-06 22:12:26,815 INFO L130 PetriNetUnfolder]: For 141/179 co-relation queries the response was YES. [2021-12-06 22:12:26,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 1036 events. 54/1036 cut-off events. For 141/179 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5277 event pairs, 0 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1196. Up to 55 conditions per place. [2021-12-06 22:12:26,841 INFO L132 encePairwiseOnDemand]: 836/851 looper letters, 39 selfloop transitions, 12 changer transitions 0/817 dead transitions. [2021-12-06 22:12:26,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 817 transitions, 1902 flow [2021-12-06 22:12:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:12:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:12:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3924 transitions. [2021-12-06 22:12:26,848 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222091656874265 [2021-12-06 22:12:26,848 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3924 transitions. [2021-12-06 22:12:26,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3924 transitions. [2021-12-06 22:12:26,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:26,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3924 transitions. [2021-12-06 22:12:26,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 784.8) internal successors, (3924), 5 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,861 INFO L186 Difference]: Start difference. First operand has 761 places, 805 transitions, 1776 flow. Second operand 5 states and 3924 transitions. [2021-12-06 22:12:26,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 817 transitions, 1902 flow [2021-12-06 22:12:26,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 763 places, 817 transitions, 1886 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-06 22:12:26,874 INFO L242 Difference]: Finished difference. Result has 764 places, 808 transitions, 1808 flow [2021-12-06 22:12:26,875 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1808, PETRI_PLACES=764, PETRI_TRANSITIONS=808} [2021-12-06 22:12:26,876 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 8 predicate places. [2021-12-06 22:12:26,876 INFO L470 AbstractCegarLoop]: Abstraction has has 764 places, 808 transitions, 1808 flow [2021-12-06 22:12:26,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 779.4) internal successors, (3897), 5 states have internal predecessors, (3897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:26,877 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:26,877 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:26,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:12:26,877 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:26,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash -502605305, now seen corresponding path program 1 times [2021-12-06 22:12:26,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:26,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63719048] [2021-12-06 22:12:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:26,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:12:26,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:26,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63719048] [2021-12-06 22:12:26,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63719048] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:12:26,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144229640] [2021-12-06 22:12:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:26,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:26,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:12:26,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:12:26,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:12:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:27,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:12:27,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:12:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:12:27,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:12:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 22:12:27,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144229640] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:12:27,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:12:27,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-12-06 22:12:27,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999175904] [2021-12-06 22:12:27,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:12:27,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-06 22:12:27,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:27,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-06 22:12:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-06 22:12:27,625 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2021-12-06 22:12:27,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 764 places, 808 transitions, 1808 flow. Second operand has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:27,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:27,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2021-12-06 22:12:27,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:28,106 INFO L129 PetriNetUnfolder]: 54/1060 cut-off events. [2021-12-06 22:12:28,106 INFO L130 PetriNetUnfolder]: For 133/170 co-relation queries the response was YES. [2021-12-06 22:12:28,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 1060 events. 54/1060 cut-off events. For 133/170 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5260 event pairs, 0 based on Foata normal form. 6/987 useless extension candidates. Maximal degree in co-relation 1260. Up to 46 conditions per place. [2021-12-06 22:12:28,130 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 42 selfloop transitions, 33 changer transitions 0/838 dead transitions. [2021-12-06 22:12:28,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 838 transitions, 2024 flow [2021-12-06 22:12:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:12:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 22:12:28,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8562 transitions. [2021-12-06 22:12:28,144 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9146458711676103 [2021-12-06 22:12:28,144 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8562 transitions. [2021-12-06 22:12:28,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8562 transitions. [2021-12-06 22:12:28,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:28,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8562 transitions. [2021-12-06 22:12:28,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 778.3636363636364) internal successors, (8562), 11 states have internal predecessors, (8562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:28,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:28,173 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:28,173 INFO L186 Difference]: Start difference. First operand has 764 places, 808 transitions, 1808 flow. Second operand 11 states and 8562 transitions. [2021-12-06 22:12:28,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 774 places, 838 transitions, 2024 flow [2021-12-06 22:12:28,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 771 places, 838 transitions, 2006 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 22:12:28,185 INFO L242 Difference]: Finished difference. Result has 774 places, 826 transitions, 1957 flow [2021-12-06 22:12:28,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1790, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1957, PETRI_PLACES=774, PETRI_TRANSITIONS=826} [2021-12-06 22:12:28,187 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 18 predicate places. [2021-12-06 22:12:28,187 INFO L470 AbstractCegarLoop]: Abstraction has has 774 places, 826 transitions, 1957 flow [2021-12-06 22:12:28,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 775.0666666666667) internal successors, (11626), 15 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:28,189 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:28,190 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:28,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:12:28,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:28,391 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1742006581, now seen corresponding path program 2 times [2021-12-06 22:12:28,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:28,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575197481] [2021-12-06 22:12:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:28,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 22:12:28,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575197481] [2021-12-06 22:12:28,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575197481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:12:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863771977] [2021-12-06 22:12:28,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:12:28,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:12:28,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:12:28,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:12:28,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 22:12:28,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:12:28,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:12:28,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:12:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-06 22:12:28,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:12:28,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863771977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:28,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:12:28,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2021-12-06 22:12:28,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415650886] [2021-12-06 22:12:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:28,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:12:28,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:12:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:12:28,869 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2021-12-06 22:12:28,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 826 transitions, 1957 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:28,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:28,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2021-12-06 22:12:28,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:30,697 INFO L129 PetriNetUnfolder]: 1481/7153 cut-off events. [2021-12-06 22:12:30,698 INFO L130 PetriNetUnfolder]: For 3573/3940 co-relation queries the response was YES. [2021-12-06 22:12:30,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11183 conditions, 7153 events. 1481/7153 cut-off events. For 3573/3940 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 75410 event pairs, 700 based on Foata normal form. 4/6534 useless extension candidates. Maximal degree in co-relation 11169. Up to 1335 conditions per place. [2021-12-06 22:12:30,868 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 111 selfloop transitions, 23 changer transitions 2/896 dead transitions. [2021-12-06 22:12:30,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 896 transitions, 2413 flow [2021-12-06 22:12:30,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:12:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:12:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5414 transitions. [2021-12-06 22:12:30,878 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088467349336915 [2021-12-06 22:12:30,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5414 transitions. [2021-12-06 22:12:30,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5414 transitions. [2021-12-06 22:12:30,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:30,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5414 transitions. [2021-12-06 22:12:30,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.4285714285714) internal successors, (5414), 7 states have internal predecessors, (5414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:30,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:30,895 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:30,895 INFO L186 Difference]: Start difference. First operand has 774 places, 826 transitions, 1957 flow. Second operand 7 states and 5414 transitions. [2021-12-06 22:12:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 780 places, 896 transitions, 2413 flow [2021-12-06 22:12:30,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 777 places, 896 transitions, 2388 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-06 22:12:30,910 INFO L242 Difference]: Finished difference. Result has 780 places, 838 transitions, 2035 flow [2021-12-06 22:12:30,911 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=771, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2035, PETRI_PLACES=780, PETRI_TRANSITIONS=838} [2021-12-06 22:12:30,911 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 24 predicate places. [2021-12-06 22:12:30,911 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 838 transitions, 2035 flow [2021-12-06 22:12:30,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:30,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:30,912 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:30,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 22:12:31,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-06 22:12:31,113 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1654571657, now seen corresponding path program 3 times [2021-12-06 22:12:31,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:31,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989792829] [2021-12-06 22:12:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:31,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 22:12:31,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:31,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989792829] [2021-12-06 22:12:31,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989792829] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:12:31,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432673975] [2021-12-06 22:12:31,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 22:12:31,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:12:31,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:12:31,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:12:31,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-12-06 22:12:31,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:12:31,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:12:31,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:12:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-06 22:12:31,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 22:12:31,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432673975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:31,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 22:12:31,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2021-12-06 22:12:31,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832021438] [2021-12-06 22:12:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:31,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:12:31,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:31,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:12:31,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-06 22:12:31,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 755 out of 851 [2021-12-06 22:12:31,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 838 transitions, 2035 flow. Second operand has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:31,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:31,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 755 of 851 [2021-12-06 22:12:31,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:33,759 INFO L129 PetriNetUnfolder]: 1489/7547 cut-off events. [2021-12-06 22:12:33,759 INFO L130 PetriNetUnfolder]: For 5189/5647 co-relation queries the response was YES. [2021-12-06 22:12:33,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 7547 events. 1489/7547 cut-off events. For 5189/5647 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 80398 event pairs, 369 based on Foata normal form. 81/7141 useless extension candidates. Maximal degree in co-relation 11652. Up to 855 conditions per place. [2021-12-06 22:12:33,971 INFO L132 encePairwiseOnDemand]: 824/851 looper letters, 133 selfloop transitions, 43 changer transitions 1/937 dead transitions. [2021-12-06 22:12:33,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 937 transitions, 2763 flow [2021-12-06 22:12:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:12:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:12:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6949 transitions. [2021-12-06 22:12:33,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072986029507769 [2021-12-06 22:12:33,985 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6949 transitions. [2021-12-06 22:12:33,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6949 transitions. [2021-12-06 22:12:33,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:33,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6949 transitions. [2021-12-06 22:12:33,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.1111111111111) internal successors, (6949), 9 states have internal predecessors, (6949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:34,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:34,006 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:34,006 INFO L186 Difference]: Start difference. First operand has 780 places, 838 transitions, 2035 flow. Second operand 9 states and 6949 transitions. [2021-12-06 22:12:34,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 937 transitions, 2763 flow [2021-12-06 22:12:34,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 788 places, 937 transitions, 2763 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 22:12:34,028 INFO L242 Difference]: Finished difference. Result has 792 places, 864 transitions, 2357 flow [2021-12-06 22:12:34,029 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=780, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2357, PETRI_PLACES=792, PETRI_TRANSITIONS=864} [2021-12-06 22:12:34,029 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 36 predicate places. [2021-12-06 22:12:34,030 INFO L470 AbstractCegarLoop]: Abstraction has has 792 places, 864 transitions, 2357 flow [2021-12-06 22:12:34,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 758.6) internal successors, (3793), 5 states have internal predecessors, (3793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:34,030 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:34,031 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:34,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 22:12:34,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-06 22:12:34,232 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -526497641, now seen corresponding path program 4 times [2021-12-06 22:12:34,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:34,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996025164] [2021-12-06 22:12:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:34,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 22:12:34,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996025164] [2021-12-06 22:12:34,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996025164] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:12:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464749854] [2021-12-06 22:12:34,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 22:12:34,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:34,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:12:34,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:12:34,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:12:34,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 22:12:34,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:12:34,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-06 22:12:34,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:12:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 22:12:34,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:12:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 22:12:35,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464749854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:12:35,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:12:35,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2021-12-06 22:12:35,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817101835] [2021-12-06 22:12:35,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:12:35,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 22:12:35,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 22:12:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-12-06 22:12:35,126 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 771 out of 851 [2021-12-06 22:12:35,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 864 transitions, 2357 flow. Second operand has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:35,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:35,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 771 of 851 [2021-12-06 22:12:35,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:35,889 INFO L129 PetriNetUnfolder]: 142/1959 cut-off events. [2021-12-06 22:12:35,889 INFO L130 PetriNetUnfolder]: For 1243/1393 co-relation queries the response was YES. [2021-12-06 22:12:35,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1959 events. 142/1959 cut-off events. For 1243/1393 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14170 event pairs, 9 based on Foata normal form. 6/1839 useless extension candidates. Maximal degree in co-relation 2813. Up to 75 conditions per place. [2021-12-06 22:12:35,944 INFO L132 encePairwiseOnDemand]: 827/851 looper letters, 54 selfloop transitions, 51 changer transitions 0/906 dead transitions. [2021-12-06 22:12:35,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 906 transitions, 2735 flow [2021-12-06 22:12:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 22:12:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-06 22:12:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 13218 transitions. [2021-12-06 22:12:35,966 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9136655837423101 [2021-12-06 22:12:35,966 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 13218 transitions. [2021-12-06 22:12:35,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 13218 transitions. [2021-12-06 22:12:35,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:35,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 13218 transitions. [2021-12-06 22:12:35,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 777.5294117647059) internal successors, (13218), 17 states have internal predecessors, (13218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:35,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:35,993 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 851.0) internal successors, (15318), 18 states have internal predecessors, (15318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:35,993 INFO L186 Difference]: Start difference. First operand has 792 places, 864 transitions, 2357 flow. Second operand 17 states and 13218 transitions. [2021-12-06 22:12:35,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 906 transitions, 2735 flow [2021-12-06 22:12:36,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 906 transitions, 2729 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-06 22:12:36,009 INFO L242 Difference]: Finished difference. Result has 811 places, 885 transitions, 2614 flow [2021-12-06 22:12:36,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=792, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2614, PETRI_PLACES=811, PETRI_TRANSITIONS=885} [2021-12-06 22:12:36,011 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 55 predicate places. [2021-12-06 22:12:36,011 INFO L470 AbstractCegarLoop]: Abstraction has has 811 places, 885 transitions, 2614 flow [2021-12-06 22:12:36,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 774.6818181818181) internal successors, (17043), 22 states have internal predecessors, (17043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:36,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:36,014 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:36,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 22:12:36,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7680f5-6959-44fa-a4ec-211a74fc6ae6/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:12:36,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 862760163, now seen corresponding path program 5 times [2021-12-06 22:12:36,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882489651] [2021-12-06 22:12:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:36,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:12:36,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882489651] [2021-12-06 22:12:36,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882489651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:36,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:36,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:36,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243193533] [2021-12-06 22:12:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:36,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:36,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:36,341 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2021-12-06 22:12:36,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 885 transitions, 2614 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:36,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:36,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2021-12-06 22:12:36,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:38,031 INFO L129 PetriNetUnfolder]: 584/6149 cut-off events. [2021-12-06 22:12:38,031 INFO L130 PetriNetUnfolder]: For 1859/2037 co-relation queries the response was YES. [2021-12-06 22:12:38,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 6149 events. 584/6149 cut-off events. For 1859/2037 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 61001 event pairs, 103 based on Foata normal form. 2/5625 useless extension candidates. Maximal degree in co-relation 8004. Up to 300 conditions per place. [2021-12-06 22:12:38,187 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 28 selfloop transitions, 4 changer transitions 0/894 dead transitions. [2021-12-06 22:12:38,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 813 places, 894 transitions, 2700 flow [2021-12-06 22:12:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2403 transitions. [2021-12-06 22:12:38,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412455934195064 [2021-12-06 22:12:38,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2403 transitions. [2021-12-06 22:12:38,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2403 transitions. [2021-12-06 22:12:38,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:38,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2403 transitions. [2021-12-06 22:12:38,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.0) internal successors, (2403), 3 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:38,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:38,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:38,198 INFO L186 Difference]: Start difference. First operand has 811 places, 885 transitions, 2614 flow. Second operand 3 states and 2403 transitions. [2021-12-06 22:12:38,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 813 places, 894 transitions, 2700 flow [2021-12-06 22:12:38,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 805 places, 894 transitions, 2633 flow, removed 12 selfloop flow, removed 8 redundant places. [2021-12-06 22:12:38,217 INFO L242 Difference]: Finished difference. Result has 806 places, 886 transitions, 2565 flow [2021-12-06 22:12:38,218 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=803, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=881, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2565, PETRI_PLACES=806, PETRI_TRANSITIONS=886} [2021-12-06 22:12:38,219 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 50 predicate places. [2021-12-06 22:12:38,219 INFO L470 AbstractCegarLoop]: Abstraction has has 806 places, 886 transitions, 2565 flow [2021-12-06 22:12:38,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:38,219 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:38,220 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:38,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 22:12:38,220 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1570533334, now seen corresponding path program 1 times [2021-12-06 22:12:38,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:38,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502664422] [2021-12-06 22:12:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:38,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:12:38,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:38,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502664422] [2021-12-06 22:12:38,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502664422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:38,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:38,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:38,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404561968] [2021-12-06 22:12:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:38,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:38,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:38,293 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2021-12-06 22:12:38,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 806 places, 886 transitions, 2565 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:38,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:38,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2021-12-06 22:12:38,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:41,019 INFO L129 PetriNetUnfolder]: 629/8651 cut-off events. [2021-12-06 22:12:41,019 INFO L130 PetriNetUnfolder]: For 2559/2857 co-relation queries the response was YES. [2021-12-06 22:12:41,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 8651 events. 629/8651 cut-off events. For 2559/2857 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 87955 event pairs, 38 based on Foata normal form. 0/7969 useless extension candidates. Maximal degree in co-relation 10980. Up to 179 conditions per place. [2021-12-06 22:12:41,247 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 29 selfloop transitions, 4 changer transitions 0/896 dead transitions. [2021-12-06 22:12:41,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 896 transitions, 2656 flow [2021-12-06 22:12:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2404 transitions. [2021-12-06 22:12:41,252 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416372894633764 [2021-12-06 22:12:41,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2404 transitions. [2021-12-06 22:12:41,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2404 transitions. [2021-12-06 22:12:41,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:41,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2404 transitions. [2021-12-06 22:12:41,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 801.3333333333334) internal successors, (2404), 3 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:41,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:41,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:41,256 INFO L186 Difference]: Start difference. First operand has 806 places, 886 transitions, 2565 flow. Second operand 3 states and 2404 transitions. [2021-12-06 22:12:41,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 896 transitions, 2656 flow [2021-12-06 22:12:41,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 807 places, 896 transitions, 2652 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:41,285 INFO L242 Difference]: Finished difference. Result has 808 places, 887 transitions, 2579 flow [2021-12-06 22:12:41,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2561, PETRI_DIFFERENCE_MINUEND_PLACES=805, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2579, PETRI_PLACES=808, PETRI_TRANSITIONS=887} [2021-12-06 22:12:41,286 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 52 predicate places. [2021-12-06 22:12:41,287 INFO L470 AbstractCegarLoop]: Abstraction has has 808 places, 887 transitions, 2579 flow [2021-12-06 22:12:41,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:41,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:41,287 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:41,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 22:12:41,287 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1945096870, now seen corresponding path program 1 times [2021-12-06 22:12:41,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:41,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178347657] [2021-12-06 22:12:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:41,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:12:41,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178347657] [2021-12-06 22:12:41,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178347657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:41,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:41,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 22:12:41,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976908836] [2021-12-06 22:12:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:41,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 22:12:41,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 22:12:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 22:12:41,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 851 [2021-12-06 22:12:41,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 887 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:41,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:41,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 851 [2021-12-06 22:12:41,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:43,818 INFO L129 PetriNetUnfolder]: 1137/9273 cut-off events. [2021-12-06 22:12:43,818 INFO L130 PetriNetUnfolder]: For 2029/2488 co-relation queries the response was YES. [2021-12-06 22:12:43,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11478 conditions, 9273 events. 1137/9273 cut-off events. For 2029/2488 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 101223 event pairs, 380 based on Foata normal form. 1/8072 useless extension candidates. Maximal degree in co-relation 11450. Up to 952 conditions per place. [2021-12-06 22:12:43,975 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 27 selfloop transitions, 4 changer transitions 0/895 dead transitions. [2021-12-06 22:12:43,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 810 places, 895 transitions, 2660 flow [2021-12-06 22:12:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 22:12:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 22:12:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2402 transitions. [2021-12-06 22:12:43,980 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9408538973756365 [2021-12-06 22:12:43,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2402 transitions. [2021-12-06 22:12:43,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2402 transitions. [2021-12-06 22:12:43,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:43,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2402 transitions. [2021-12-06 22:12:43,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 800.6666666666666) internal successors, (2402), 3 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:43,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:43,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 851.0) internal successors, (3404), 4 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:43,984 INFO L186 Difference]: Start difference. First operand has 808 places, 887 transitions, 2579 flow. Second operand 3 states and 2402 transitions. [2021-12-06 22:12:43,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 810 places, 895 transitions, 2660 flow [2021-12-06 22:12:43,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 809 places, 895 transitions, 2656 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:44,008 INFO L242 Difference]: Finished difference. Result has 810 places, 888 transitions, 2593 flow [2021-12-06 22:12:44,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2593, PETRI_PLACES=810, PETRI_TRANSITIONS=888} [2021-12-06 22:12:44,010 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 54 predicate places. [2021-12-06 22:12:44,010 INFO L470 AbstractCegarLoop]: Abstraction has has 810 places, 888 transitions, 2593 flow [2021-12-06 22:12:44,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:44,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:44,011 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:44,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 22:12:44,011 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1735256126, now seen corresponding path program 1 times [2021-12-06 22:12:44,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:44,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357401267] [2021-12-06 22:12:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:44,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:12:44,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357401267] [2021-12-06 22:12:44,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357401267] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:44,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:44,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:12:44,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007779222] [2021-12-06 22:12:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:44,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:12:44,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:12:44,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:12:44,153 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:12:44,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 810 places, 888 transitions, 2593 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:44,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:44,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:12:44,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:12:56,667 INFO L129 PetriNetUnfolder]: 8778/52330 cut-off events. [2021-12-06 22:12:56,667 INFO L130 PetriNetUnfolder]: For 37937/44699 co-relation queries the response was YES. [2021-12-06 22:12:57,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81506 conditions, 52330 events. 8778/52330 cut-off events. For 37937/44699 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 760276 event pairs, 3260 based on Foata normal form. 310/49102 useless extension candidates. Maximal degree in co-relation 81477. Up to 4529 conditions per place. [2021-12-06 22:12:57,914 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 214 selfloop transitions, 21 changer transitions 2/1034 dead transitions. [2021-12-06 22:12:57,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 1034 transitions, 3682 flow [2021-12-06 22:12:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:12:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:12:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5432 transitions. [2021-12-06 22:12:57,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9118683901292597 [2021-12-06 22:12:57,920 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5432 transitions. [2021-12-06 22:12:57,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5432 transitions. [2021-12-06 22:12:57,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:12:57,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5432 transitions. [2021-12-06 22:12:57,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.0) internal successors, (5432), 7 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:57,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:57,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:57,931 INFO L186 Difference]: Start difference. First operand has 810 places, 888 transitions, 2593 flow. Second operand 7 states and 5432 transitions. [2021-12-06 22:12:57,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 1034 transitions, 3682 flow [2021-12-06 22:12:58,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 1034 transitions, 3678 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:12:58,092 INFO L242 Difference]: Finished difference. Result has 820 places, 910 transitions, 2877 flow [2021-12-06 22:12:58,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2589, PETRI_DIFFERENCE_MINUEND_PLACES=809, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=874, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2877, PETRI_PLACES=820, PETRI_TRANSITIONS=910} [2021-12-06 22:12:58,094 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 64 predicate places. [2021-12-06 22:12:58,094 INFO L470 AbstractCegarLoop]: Abstraction has has 820 places, 910 transitions, 2877 flow [2021-12-06 22:12:58,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:58,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:12:58,095 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:12:58,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 22:12:58,095 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:12:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:12:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash -223892668, now seen corresponding path program 2 times [2021-12-06 22:12:58,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:12:58,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942224703] [2021-12-06 22:12:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:12:58,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:12:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:12:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:12:58,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:12:58,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942224703] [2021-12-06 22:12:58,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942224703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:12:58,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:12:58,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:12:58,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033428956] [2021-12-06 22:12:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:12:58,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:12:58,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:12:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:12:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:12:58,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:12:58,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 910 transitions, 2877 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:12:58,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:12:58,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:12:58,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:13:10,392 INFO L129 PetriNetUnfolder]: 8593/48956 cut-off events. [2021-12-06 22:13:10,392 INFO L130 PetriNetUnfolder]: For 51841/60724 co-relation queries the response was YES. [2021-12-06 22:13:11,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81244 conditions, 48956 events. 8593/48956 cut-off events. For 51841/60724 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 699842 event pairs, 3042 based on Foata normal form. 435/46751 useless extension candidates. Maximal degree in co-relation 81211. Up to 4529 conditions per place. [2021-12-06 22:13:11,448 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 184 selfloop transitions, 21 changer transitions 3/1005 dead transitions. [2021-12-06 22:13:11,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 1005 transitions, 3719 flow [2021-12-06 22:13:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:13:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:13:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5402 transitions. [2021-12-06 22:13:11,452 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906832298136646 [2021-12-06 22:13:11,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5402 transitions. [2021-12-06 22:13:11,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5402 transitions. [2021-12-06 22:13:11,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:13:11,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5402 transitions. [2021-12-06 22:13:11,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 771.7142857142857) internal successors, (5402), 7 states have internal predecessors, (5402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:11,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:11,460 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:11,460 INFO L186 Difference]: Start difference. First operand has 820 places, 910 transitions, 2877 flow. Second operand 7 states and 5402 transitions. [2021-12-06 22:13:11,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 1005 transitions, 3719 flow [2021-12-06 22:13:11,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 1005 transitions, 3719 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 22:13:11,650 INFO L242 Difference]: Finished difference. Result has 828 places, 912 transitions, 2977 flow [2021-12-06 22:13:11,651 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=910, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=889, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2977, PETRI_PLACES=828, PETRI_TRANSITIONS=912} [2021-12-06 22:13:11,652 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 72 predicate places. [2021-12-06 22:13:11,652 INFO L470 AbstractCegarLoop]: Abstraction has has 828 places, 912 transitions, 2977 flow [2021-12-06 22:13:11,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:11,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:13:11,653 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:13:11,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 22:13:11,653 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:13:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:13:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -557134478, now seen corresponding path program 3 times [2021-12-06 22:13:11,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:13:11,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666928270] [2021-12-06 22:13:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:13:11,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:13:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:13:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:13:11,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:13:11,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666928270] [2021-12-06 22:13:11,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666928270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:13:11,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:13:11,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:13:11,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243229993] [2021-12-06 22:13:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:13:11,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:13:11,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:13:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:13:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:13:11,781 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:13:11,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 912 transitions, 2977 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:11,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:13:11,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:13:11,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:13:25,808 INFO L129 PetriNetUnfolder]: 9322/54905 cut-off events. [2021-12-06 22:13:25,809 INFO L130 PetriNetUnfolder]: For 66735/75920 co-relation queries the response was YES. [2021-12-06 22:13:26,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91388 conditions, 54905 events. 9322/54905 cut-off events. For 66735/75920 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 808336 event pairs, 4814 based on Foata normal form. 327/52394 useless extension candidates. Maximal degree in co-relation 91352. Up to 8166 conditions per place. [2021-12-06 22:13:27,165 INFO L132 encePairwiseOnDemand]: 835/851 looper letters, 199 selfloop transitions, 35 changer transitions 4/1035 dead transitions. [2021-12-06 22:13:27,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1035 transitions, 3932 flow [2021-12-06 22:13:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:13:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 22:13:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4666 transitions. [2021-12-06 22:13:27,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9138268703486094 [2021-12-06 22:13:27,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4666 transitions. [2021-12-06 22:13:27,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4666 transitions. [2021-12-06 22:13:27,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:13:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4666 transitions. [2021-12-06 22:13:27,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 777.6666666666666) internal successors, (4666), 6 states have internal predecessors, (4666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:27,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:27,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:27,175 INFO L186 Difference]: Start difference. First operand has 828 places, 912 transitions, 2977 flow. Second operand 6 states and 4666 transitions. [2021-12-06 22:13:27,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 1035 transitions, 3932 flow [2021-12-06 22:13:27,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 829 places, 1035 transitions, 3883 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-12-06 22:13:27,383 INFO L242 Difference]: Finished difference. Result has 834 places, 935 transitions, 3267 flow [2021-12-06 22:13:27,384 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=2946, PETRI_DIFFERENCE_MINUEND_PLACES=824, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3267, PETRI_PLACES=834, PETRI_TRANSITIONS=935} [2021-12-06 22:13:27,384 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 78 predicate places. [2021-12-06 22:13:27,384 INFO L470 AbstractCegarLoop]: Abstraction has has 834 places, 935 transitions, 3267 flow [2021-12-06 22:13:27,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:27,385 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:13:27,385 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:13:27,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 22:13:27,385 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:13:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:13:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -779960328, now seen corresponding path program 4 times [2021-12-06 22:13:27,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:13:27,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141380502] [2021-12-06 22:13:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:13:27,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:13:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:13:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:13:27,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:13:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141380502] [2021-12-06 22:13:27,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141380502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:13:27,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:13:27,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:13:27,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576216617] [2021-12-06 22:13:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:13:27,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:13:27,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:13:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:13:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:13:27,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:13:27,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 935 transitions, 3267 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:27,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:13:27,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:13:27,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:13:43,471 INFO L129 PetriNetUnfolder]: 9788/63753 cut-off events. [2021-12-06 22:13:43,472 INFO L130 PetriNetUnfolder]: For 76890/83300 co-relation queries the response was YES. [2021-12-06 22:13:44,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104705 conditions, 63753 events. 9788/63753 cut-off events. For 76890/83300 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 976826 event pairs, 5758 based on Foata normal form. 41/60431 useless extension candidates. Maximal degree in co-relation 104665. Up to 10305 conditions per place. [2021-12-06 22:13:45,116 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 214 selfloop transitions, 24 changer transitions 13/1048 dead transitions. [2021-12-06 22:13:45,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 839 places, 1048 transitions, 4153 flow [2021-12-06 22:13:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:13:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:13:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5413 transitions. [2021-12-06 22:13:45,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9086788652006044 [2021-12-06 22:13:45,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5413 transitions. [2021-12-06 22:13:45,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5413 transitions. [2021-12-06 22:13:45,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:13:45,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5413 transitions. [2021-12-06 22:13:45,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 773.2857142857143) internal successors, (5413), 7 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:45,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:45,131 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:45,131 INFO L186 Difference]: Start difference. First operand has 834 places, 935 transitions, 3267 flow. Second operand 7 states and 5413 transitions. [2021-12-06 22:13:45,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 839 places, 1048 transitions, 4153 flow [2021-12-06 22:13:45,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 838 places, 1048 transitions, 4143 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-06 22:13:45,749 INFO L242 Difference]: Finished difference. Result has 842 places, 938 transitions, 3368 flow [2021-12-06 22:13:45,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=832, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=911, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3368, PETRI_PLACES=842, PETRI_TRANSITIONS=938} [2021-12-06 22:13:45,750 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 86 predicate places. [2021-12-06 22:13:45,751 INFO L470 AbstractCegarLoop]: Abstraction has has 842 places, 938 transitions, 3368 flow [2021-12-06 22:13:45,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:45,751 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:13:45,752 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:13:45,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 22:13:45,752 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:13:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:13:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 173589260, now seen corresponding path program 1 times [2021-12-06 22:13:45,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:13:45,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998941953] [2021-12-06 22:13:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:13:45,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:13:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:13:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:13:45,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:13:45,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998941953] [2021-12-06 22:13:45,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998941953] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:13:45,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:13:45,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:13:45,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067042871] [2021-12-06 22:13:45,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:13:45,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:13:45,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:13:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:13:45,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:13:45,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 851 [2021-12-06 22:13:45,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 938 transitions, 3368 flow. Second operand has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:45,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:13:45,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 851 [2021-12-06 22:13:45,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:13:49,650 INFO L129 PetriNetUnfolder]: 839/11109 cut-off events. [2021-12-06 22:13:49,650 INFO L130 PetriNetUnfolder]: For 9757/12404 co-relation queries the response was YES. [2021-12-06 22:13:49,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 11109 events. 839/11109 cut-off events. For 9757/12404 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 127064 event pairs, 77 based on Foata normal form. 58/10286 useless extension candidates. Maximal degree in co-relation 15355. Up to 741 conditions per place. [2021-12-06 22:13:49,931 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 55 selfloop transitions, 3 changer transitions 4/952 dead transitions. [2021-12-06 22:13:49,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 952 transitions, 3529 flow [2021-12-06 22:13:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:13:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:13:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5369 transitions. [2021-12-06 22:13:49,934 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9012925969447708 [2021-12-06 22:13:49,935 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5369 transitions. [2021-12-06 22:13:49,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5369 transitions. [2021-12-06 22:13:49,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:13:49,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5369 transitions. [2021-12-06 22:13:49,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 767.0) internal successors, (5369), 7 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:49,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:49,942 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:49,942 INFO L186 Difference]: Start difference. First operand has 842 places, 938 transitions, 3368 flow. Second operand 7 states and 5369 transitions. [2021-12-06 22:13:49,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 952 transitions, 3529 flow [2021-12-06 22:13:49,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 843 places, 952 transitions, 3506 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-06 22:13:49,977 INFO L242 Difference]: Finished difference. Result has 848 places, 940 transitions, 3370 flow [2021-12-06 22:13:49,978 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3345, PETRI_DIFFERENCE_MINUEND_PLACES=837, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3370, PETRI_PLACES=848, PETRI_TRANSITIONS=940} [2021-12-06 22:13:49,978 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 92 predicate places. [2021-12-06 22:13:49,978 INFO L470 AbstractCegarLoop]: Abstraction has has 848 places, 940 transitions, 3370 flow [2021-12-06 22:13:49,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 764.5) internal successors, (4587), 6 states have internal predecessors, (4587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:49,979 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:13:49,979 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:13:49,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 22:13:49,979 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:13:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:13:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -623110652, now seen corresponding path program 5 times [2021-12-06 22:13:49,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:13:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87674770] [2021-12-06 22:13:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:13:49,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:13:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:13:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:13:50,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:13:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87674770] [2021-12-06 22:13:50,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87674770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:13:50,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:13:50,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:13:50,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754337409] [2021-12-06 22:13:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:13:50,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:13:50,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:13:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:13:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:13:50,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:13:50,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 848 places, 940 transitions, 3370 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:13:50,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:13:50,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:13:50,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:14:07,003 INFO L129 PetriNetUnfolder]: 9797/64246 cut-off events. [2021-12-06 22:14:07,003 INFO L130 PetriNetUnfolder]: For 83351/89923 co-relation queries the response was YES. [2021-12-06 22:14:08,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107357 conditions, 64246 events. 9797/64246 cut-off events. For 83351/89923 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 986947 event pairs, 5244 based on Foata normal form. 204/61268 useless extension candidates. Maximal degree in co-relation 107310. Up to 9165 conditions per place. [2021-12-06 22:14:08,545 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 215 selfloop transitions, 43 changer transitions 5/1062 dead transitions. [2021-12-06 22:14:08,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 1062 transitions, 4341 flow [2021-12-06 22:14:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:14:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:14:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5433 transitions. [2021-12-06 22:14:08,549 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9120362598623468 [2021-12-06 22:14:08,549 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5433 transitions. [2021-12-06 22:14:08,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5433 transitions. [2021-12-06 22:14:08,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:14:08,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5433 transitions. [2021-12-06 22:14:08,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 776.1428571428571) internal successors, (5433), 7 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:08,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:08,556 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:08,556 INFO L186 Difference]: Start difference. First operand has 848 places, 940 transitions, 3370 flow. Second operand 7 states and 5433 transitions. [2021-12-06 22:14:08,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 852 places, 1062 transitions, 4341 flow [2021-12-06 22:14:09,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 849 places, 1062 transitions, 4336 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-06 22:14:09,109 INFO L242 Difference]: Finished difference. Result has 854 places, 943 transitions, 3526 flow [2021-12-06 22:14:09,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=898, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3526, PETRI_PLACES=854, PETRI_TRANSITIONS=943} [2021-12-06 22:14:09,110 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 98 predicate places. [2021-12-06 22:14:09,110 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 943 transitions, 3526 flow [2021-12-06 22:14:09,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:09,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:14:09,111 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:14:09,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 22:14:09,111 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:14:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:14:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1979499548, now seen corresponding path program 6 times [2021-12-06 22:14:09,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:14:09,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682068127] [2021-12-06 22:14:09,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:14:09,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:14:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:14:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:14:09,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:14:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682068127] [2021-12-06 22:14:09,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682068127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:14:09,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:14:09,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:14:09,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342824943] [2021-12-06 22:14:09,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:14:09,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:14:09,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:14:09,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:14:09,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:14:09,215 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:14:09,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 943 transitions, 3526 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:09,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:14:09,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:14:09,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:14:25,620 INFO L129 PetriNetUnfolder]: 9544/62437 cut-off events. [2021-12-06 22:14:25,620 INFO L130 PetriNetUnfolder]: For 106699/113969 co-relation queries the response was YES. [2021-12-06 22:14:26,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106187 conditions, 62437 events. 9544/62437 cut-off events. For 106699/113969 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 953071 event pairs, 6147 based on Foata normal form. 125/59416 useless extension candidates. Maximal degree in co-relation 106137. Up to 11200 conditions per place. [2021-12-06 22:14:27,222 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 193 selfloop transitions, 21 changer transitions 19/1032 dead transitions. [2021-12-06 22:14:27,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 1032 transitions, 4441 flow [2021-12-06 22:14:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 22:14:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 22:14:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5380 transitions. [2021-12-06 22:14:27,226 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9031391640087292 [2021-12-06 22:14:27,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 5380 transitions. [2021-12-06 22:14:27,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 5380 transitions. [2021-12-06 22:14:27,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:14:27,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 5380 transitions. [2021-12-06 22:14:27,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 768.5714285714286) internal successors, (5380), 7 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:27,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:27,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 851.0) internal successors, (6808), 8 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:27,234 INFO L186 Difference]: Start difference. First operand has 854 places, 943 transitions, 3526 flow. Second operand 7 states and 5380 transitions. [2021-12-06 22:14:27,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 859 places, 1032 transitions, 4441 flow [2021-12-06 22:14:27,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 857 places, 1032 transitions, 4397 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-12-06 22:14:27,916 INFO L242 Difference]: Finished difference. Result has 861 places, 954 transitions, 3675 flow [2021-12-06 22:14:27,917 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=851, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3675, PETRI_PLACES=861, PETRI_TRANSITIONS=954} [2021-12-06 22:14:27,917 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 105 predicate places. [2021-12-06 22:14:27,917 INFO L470 AbstractCegarLoop]: Abstraction has has 861 places, 954 transitions, 3675 flow [2021-12-06 22:14:27,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:27,918 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:14:27,918 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:14:27,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 22:14:27,918 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:14:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:14:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -30601328, now seen corresponding path program 7 times [2021-12-06 22:14:27,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:14:27,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959003833] [2021-12-06 22:14:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:14:27,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:14:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:14:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:14:28,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:14:28,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959003833] [2021-12-06 22:14:28,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959003833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:14:28,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:14:28,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:14:28,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894086166] [2021-12-06 22:14:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:14:28,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:14:28,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:14:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:14:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:14:28,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:14:28,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 954 transitions, 3675 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:28,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:14:28,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:14:28,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:14:47,790 INFO L129 PetriNetUnfolder]: 11198/77159 cut-off events. [2021-12-06 22:14:47,791 INFO L130 PetriNetUnfolder]: For 116743/121649 co-relation queries the response was YES. [2021-12-06 22:14:49,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124743 conditions, 77159 events. 11198/77159 cut-off events. For 116743/121649 co-relation queries the response was YES. Maximal size of possible extension queue 1346. Compared 1220803 event pairs, 4495 based on Foata normal form. 366/72638 useless extension candidates. Maximal degree in co-relation 124689. Up to 6724 conditions per place. [2021-12-06 22:14:49,909 INFO L132 encePairwiseOnDemand]: 814/851 looper letters, 206 selfloop transitions, 118 changer transitions 8/1131 dead transitions. [2021-12-06 22:14:49,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 1131 transitions, 5350 flow [2021-12-06 22:14:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:14:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:14:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6961 transitions. [2021-12-06 22:14:49,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9088653871262566 [2021-12-06 22:14:49,914 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6961 transitions. [2021-12-06 22:14:49,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6961 transitions. [2021-12-06 22:14:49,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:14:49,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6961 transitions. [2021-12-06 22:14:49,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 773.4444444444445) internal successors, (6961), 9 states have internal predecessors, (6961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:49,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:49,925 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:49,925 INFO L186 Difference]: Start difference. First operand has 861 places, 954 transitions, 3675 flow. Second operand 9 states and 6961 transitions. [2021-12-06 22:14:49,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 1131 transitions, 5350 flow [2021-12-06 22:14:50,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 868 places, 1131 transitions, 5328 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-12-06 22:14:50,691 INFO L242 Difference]: Finished difference. Result has 875 places, 1019 transitions, 4668 flow [2021-12-06 22:14:50,692 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=3661, PETRI_DIFFERENCE_MINUEND_PLACES=860, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=954, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=872, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4668, PETRI_PLACES=875, PETRI_TRANSITIONS=1019} [2021-12-06 22:14:50,692 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 119 predicate places. [2021-12-06 22:14:50,692 INFO L470 AbstractCegarLoop]: Abstraction has has 875 places, 1019 transitions, 4668 flow [2021-12-06 22:14:50,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:50,693 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:14:50,693 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:14:50,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 22:14:50,693 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:14:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:14:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 381741258, now seen corresponding path program 8 times [2021-12-06 22:14:50,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:14:50,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318749089] [2021-12-06 22:14:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:14:50,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:14:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:14:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:14:50,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:14:50,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318749089] [2021-12-06 22:14:50,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318749089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:14:50,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:14:50,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:14:50,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160687148] [2021-12-06 22:14:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:14:50,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:14:50,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:14:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:14:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:14:50,803 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:14:50,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 875 places, 1019 transitions, 4668 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:14:50,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:14:50,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:14:50,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:15:10,602 INFO L129 PetriNetUnfolder]: 10965/74335 cut-off events. [2021-12-06 22:15:10,602 INFO L130 PetriNetUnfolder]: For 147327/152218 co-relation queries the response was YES. [2021-12-06 22:15:12,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129898 conditions, 74335 events. 10965/74335 cut-off events. For 147327/152218 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 1167604 event pairs, 4473 based on Foata normal form. 369/70322 useless extension candidates. Maximal degree in co-relation 129838. Up to 6724 conditions per place. [2021-12-06 22:15:12,654 INFO L132 encePairwiseOnDemand]: 813/851 looper letters, 173 selfloop transitions, 112 changer transitions 15/1099 dead transitions. [2021-12-06 22:15:12,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 1099 transitions, 5686 flow [2021-12-06 22:15:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 22:15:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 22:15:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6164 transitions. [2021-12-06 22:15:12,658 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9054054054054054 [2021-12-06 22:15:12,658 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6164 transitions. [2021-12-06 22:15:12,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6164 transitions. [2021-12-06 22:15:12,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:15:12,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6164 transitions. [2021-12-06 22:15:12,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 770.5) internal successors, (6164), 8 states have internal predecessors, (6164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:12,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:12,667 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:12,667 INFO L186 Difference]: Start difference. First operand has 875 places, 1019 transitions, 4668 flow. Second operand 8 states and 6164 transitions. [2021-12-06 22:15:12,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 880 places, 1099 transitions, 5686 flow [2021-12-06 22:15:14,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 879 places, 1099 transitions, 5676 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-06 22:15:14,135 INFO L242 Difference]: Finished difference. Result has 883 places, 1019 transitions, 5032 flow [2021-12-06 22:15:14,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=872, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5032, PETRI_PLACES=883, PETRI_TRANSITIONS=1019} [2021-12-06 22:15:14,136 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 127 predicate places. [2021-12-06 22:15:14,136 INFO L470 AbstractCegarLoop]: Abstraction has has 883 places, 1019 transitions, 5032 flow [2021-12-06 22:15:14,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:14,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:15:14,137 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:15:14,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 22:15:14,138 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:15:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:15:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1027995298, now seen corresponding path program 9 times [2021-12-06 22:15:14,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:15:14,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254417090] [2021-12-06 22:15:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:15:14,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:15:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:15:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:15:14,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:15:14,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254417090] [2021-12-06 22:15:14,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254417090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:15:14,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:15:14,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:15:14,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362707531] [2021-12-06 22:15:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:15:14,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:15:14,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:15:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:15:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:15:14,257 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:15:14,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 1019 transitions, 5032 flow. Second operand has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:14,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:15:14,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:15:14,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:15:33,571 INFO L129 PetriNetUnfolder]: 10542/70042 cut-off events. [2021-12-06 22:15:33,572 INFO L130 PetriNetUnfolder]: For 180239/184855 co-relation queries the response was YES. [2021-12-06 22:15:35,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128298 conditions, 70042 events. 10542/70042 cut-off events. For 180239/184855 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 1089748 event pairs, 5498 based on Foata normal form. 274/66358 useless extension candidates. Maximal degree in co-relation 128234. Up to 8619 conditions per place. [2021-12-06 22:15:35,554 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 210 selfloop transitions, 50 changer transitions 14/1073 dead transitions. [2021-12-06 22:15:35,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 887 places, 1073 transitions, 5819 flow [2021-12-06 22:15:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 22:15:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 22:15:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4632 transitions. [2021-12-06 22:15:35,558 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9071680376028202 [2021-12-06 22:15:35,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 4632 transitions. [2021-12-06 22:15:35,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 4632 transitions. [2021-12-06 22:15:35,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:15:35,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 4632 transitions. [2021-12-06 22:15:35,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 772.0) internal successors, (4632), 6 states have internal predecessors, (4632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:35,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:35,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 851.0) internal successors, (5957), 7 states have internal predecessors, (5957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:35,565 INFO L186 Difference]: Start difference. First operand has 883 places, 1019 transitions, 5032 flow. Second operand 6 states and 4632 transitions. [2021-12-06 22:15:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 887 places, 1073 transitions, 5819 flow [2021-12-06 22:15:37,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 882 places, 1073 transitions, 5638 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-12-06 22:15:37,397 INFO L242 Difference]: Finished difference. Result has 886 places, 1018 transitions, 4977 flow [2021-12-06 22:15:37,398 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4802, PETRI_DIFFERENCE_MINUEND_PLACES=877, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4977, PETRI_PLACES=886, PETRI_TRANSITIONS=1018} [2021-12-06 22:15:37,399 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 130 predicate places. [2021-12-06 22:15:37,399 INFO L470 AbstractCegarLoop]: Abstraction has has 886 places, 1018 transitions, 4977 flow [2021-12-06 22:15:37,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 751.6666666666666) internal successors, (4510), 6 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:37,399 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:15:37,400 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:15:37,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 22:15:37,400 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:15:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:15:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1379995286, now seen corresponding path program 1 times [2021-12-06 22:15:37,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:15:37,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523534507] [2021-12-06 22:15:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:15:37,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:15:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:15:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:15:37,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:15:37,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523534507] [2021-12-06 22:15:37,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523534507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:15:37,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:15:37,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 22:15:37,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906208690] [2021-12-06 22:15:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:15:37,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 22:15:37,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:15:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 22:15:37,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 22:15:37,487 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 851 [2021-12-06 22:15:37,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 1018 transitions, 4977 flow. Second operand has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:15:37,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:15:37,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 851 [2021-12-06 22:15:37,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:15:53,894 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), 253#L96-14true, Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:53,894 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2021-12-06 22:15:53,894 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2021-12-06 22:15:53,894 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2021-12-06 22:15:53,894 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2021-12-06 22:15:54,295 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:54,296 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2021-12-06 22:15:54,296 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2021-12-06 22:15:54,296 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2021-12-06 22:15:54,296 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2021-12-06 22:15:54,633 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:54,633 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2021-12-06 22:15:54,633 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2021-12-06 22:15:54,633 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2021-12-06 22:15:54,633 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2021-12-06 22:15:57,284 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 680#L160-2true, Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:57,284 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2021-12-06 22:15:57,284 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2021-12-06 22:15:57,284 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2021-12-06 22:15:57,284 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2021-12-06 22:15:57,718 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 253#L96-14true, Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:57,718 INFO L384 tUnfolder$Statistics]: this new event has 388 ancestors and is cut-off event [2021-12-06 22:15:57,718 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2021-12-06 22:15:57,718 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2021-12-06 22:15:57,718 INFO L387 tUnfolder$Statistics]: existing Event has 388 ancestors and is cut-off event [2021-12-06 22:15:57,718 INFO L387 tUnfolder$Statistics]: existing Event has 340 ancestors and is cut-off event [2021-12-06 22:15:58,084 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:58,084 INFO L384 tUnfolder$Statistics]: this new event has 389 ancestors and is cut-off event [2021-12-06 22:15:58,084 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2021-12-06 22:15:58,084 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2021-12-06 22:15:58,084 INFO L387 tUnfolder$Statistics]: existing Event has 389 ancestors and is cut-off event [2021-12-06 22:15:58,084 INFO L387 tUnfolder$Statistics]: existing Event has 341 ancestors and is cut-off event [2021-12-06 22:15:58,498 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 606#L96-16true, Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:15:58,498 INFO L384 tUnfolder$Statistics]: this new event has 390 ancestors and is cut-off event [2021-12-06 22:15:58,499 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2021-12-06 22:15:58,499 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2021-12-06 22:15:58,499 INFO L387 tUnfolder$Statistics]: existing Event has 390 ancestors and is cut-off event [2021-12-06 22:15:58,499 INFO L387 tUnfolder$Statistics]: existing Event has 342 ancestors and is cut-off event [2021-12-06 22:16:01,731 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2509] L123-14-->L123-15: Formula: (= v_~result_18~0_9 |v_thread3Thread1of1ForFork1_#t~ite84#1_3|) InVars {thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|} OutVars{thread3Thread1of1ForFork1_#t~ite84#1=|v_thread3Thread1of1ForFork1_#t~ite84#1_3|, ~result_18~0=v_~result_18~0_9} AuxVars[] AssignedVars[~result_18~0][477], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 680#L160-2true, Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6323#(= ~break_14~0 0), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 36#L123-15true, Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:16:01,731 INFO L384 tUnfolder$Statistics]: this new event has 397 ancestors and is cut-off event [2021-12-06 22:16:01,731 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2021-12-06 22:16:01,731 INFO L387 tUnfolder$Statistics]: existing Event has 397 ancestors and is cut-off event [2021-12-06 22:16:01,731 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2021-12-06 22:16:01,731 INFO L387 tUnfolder$Statistics]: existing Event has 349 ancestors and is cut-off event [2021-12-06 22:16:29,240 INFO L129 PetriNetUnfolder]: 35999/188452 cut-off events. [2021-12-06 22:16:29,240 INFO L130 PetriNetUnfolder]: For 140435/151291 co-relation queries the response was YES. [2021-12-06 22:16:33,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263519 conditions, 188452 events. 35999/188452 cut-off events. For 140435/151291 co-relation queries the response was YES. Maximal size of possible extension queue 3111. Compared 3175488 event pairs, 15632 based on Foata normal form. 300/167831 useless extension candidates. Maximal degree in co-relation 263454. Up to 31354 conditions per place. [2021-12-06 22:16:34,146 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 129 selfloop transitions, 5 changer transitions 4/1085 dead transitions. [2021-12-06 22:16:34,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 893 places, 1085 transitions, 5403 flow [2021-12-06 22:16:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 22:16:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-06 22:16:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 6026 transitions. [2021-12-06 22:16:34,150 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851351351351351 [2021-12-06 22:16:34,150 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 6026 transitions. [2021-12-06 22:16:34,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 6026 transitions. [2021-12-06 22:16:34,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:16:34,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 6026 transitions. [2021-12-06 22:16:34,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 753.25) internal successors, (6026), 8 states have internal predecessors, (6026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:16:34,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:16:34,160 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 851.0) internal successors, (7659), 9 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:16:34,160 INFO L186 Difference]: Start difference. First operand has 886 places, 1018 transitions, 4977 flow. Second operand 8 states and 6026 transitions. [2021-12-06 22:16:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 893 places, 1085 transitions, 5403 flow [2021-12-06 22:16:36,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 892 places, 1085 transitions, 5344 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-12-06 22:16:36,243 INFO L242 Difference]: Finished difference. Result has 897 places, 1020 transitions, 4947 flow [2021-12-06 22:16:36,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4918, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4947, PETRI_PLACES=897, PETRI_TRANSITIONS=1020} [2021-12-06 22:16:36,244 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 141 predicate places. [2021-12-06 22:16:36,244 INFO L470 AbstractCegarLoop]: Abstraction has has 897 places, 1020 transitions, 4947 flow [2021-12-06 22:16:36,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 742.4285714285714) internal successors, (5197), 7 states have internal predecessors, (5197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:16:36,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:16:36,245 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:16:36,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 22:16:36,246 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:16:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:16:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash -674811482, now seen corresponding path program 1 times [2021-12-06 22:16:36,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:16:36,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509849881] [2021-12-06 22:16:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:16:36,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:16:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:16:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:16:36,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:16:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509849881] [2021-12-06 22:16:36,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509849881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:16:36,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:16:36,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:16:36,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10598606] [2021-12-06 22:16:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:16:36,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:16:36,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:16:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:16:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:16:36,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 851 [2021-12-06 22:16:36,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 897 places, 1020 transitions, 4947 flow. Second operand has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:16:36,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:16:36,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 851 [2021-12-06 22:16:36,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:16:53,868 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite83#1_1| 1005) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:16:53,869 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2021-12-06 22:16:53,869 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2021-12-06 22:16:53,869 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2021-12-06 22:16:53,869 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2021-12-06 22:16:56,921 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite83#1_1| 1005) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 680#L160-2true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6318#(= ~break_17~0 0), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:16:56,921 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2021-12-06 22:16:56,921 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2021-12-06 22:16:56,921 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2021-12-06 22:16:56,921 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2021-12-06 22:16:57,690 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite83#1_1| 1005) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 97#L96-15true, 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:16:57,690 INFO L384 tUnfolder$Statistics]: this new event has 387 ancestors and is cut-off event [2021-12-06 22:16:57,690 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2021-12-06 22:16:57,690 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2021-12-06 22:16:57,690 INFO L387 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2021-12-06 22:16:57,690 INFO L387 tUnfolder$Statistics]: existing Event has 387 ancestors and is cut-off event [2021-12-06 22:17:01,074 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([2510] L123-4-->L123-13: Formula: (= |v_thread3Thread1of1ForFork1_#t~ite83#1_1| 1005) InVars {} OutVars{thread3Thread1of1ForFork1_#t~ite83#1=|v_thread3Thread1of1ForFork1_#t~ite83#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~ite83#1][476], [Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), Black: 6387#(<= (+ ~result_12~0 995) 0), 6483#true, 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), 680#L160-2true, Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6433#true, Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6494#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6496#(and (<= (+ ~result_15~0 995) 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 396#L123-13true, Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)]) [2021-12-06 22:17:01,074 INFO L384 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2021-12-06 22:17:01,074 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2021-12-06 22:17:01,075 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2021-12-06 22:17:01,075 INFO L387 tUnfolder$Statistics]: existing Event has 347 ancestors and is cut-off event [2021-12-06 22:17:01,075 INFO L387 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2021-12-06 22:17:31,215 INFO L129 PetriNetUnfolder]: 43180/195755 cut-off events. [2021-12-06 22:17:31,216 INFO L130 PetriNetUnfolder]: For 138591/158791 co-relation queries the response was YES. [2021-12-06 22:17:36,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 291251 conditions, 195755 events. 43180/195755 cut-off events. For 138591/158791 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 3241485 event pairs, 14598 based on Foata normal form. 406/176212 useless extension candidates. Maximal degree in co-relation 291181. Up to 29037 conditions per place. [2021-12-06 22:17:36,722 INFO L132 encePairwiseOnDemand]: 841/851 looper letters, 167 selfloop transitions, 7 changer transitions 9/1128 dead transitions. [2021-12-06 22:17:36,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 1128 transitions, 5566 flow [2021-12-06 22:17:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 22:17:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 22:17:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 7512 transitions. [2021-12-06 22:17:36,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827262044653349 [2021-12-06 22:17:36,727 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 7512 transitions. [2021-12-06 22:17:36,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 7512 transitions. [2021-12-06 22:17:36,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:17:36,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 7512 transitions. [2021-12-06 22:17:36,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 751.2) internal successors, (7512), 10 states have internal predecessors, (7512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:36,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:36,739 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 851.0) internal successors, (9361), 11 states have internal predecessors, (9361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:36,739 INFO L186 Difference]: Start difference. First operand has 897 places, 1020 transitions, 4947 flow. Second operand 10 states and 7512 transitions. [2021-12-06 22:17:36,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 904 places, 1128 transitions, 5566 flow [2021-12-06 22:17:39,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 900 places, 1128 transitions, 5555 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-12-06 22:17:39,097 INFO L242 Difference]: Finished difference. Result has 907 places, 1024 transitions, 4983 flow [2021-12-06 22:17:39,098 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4938, PETRI_DIFFERENCE_MINUEND_PLACES=891, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4983, PETRI_PLACES=907, PETRI_TRANSITIONS=1024} [2021-12-06 22:17:39,098 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 151 predicate places. [2021-12-06 22:17:39,098 INFO L470 AbstractCegarLoop]: Abstraction has has 907 places, 1024 transitions, 4983 flow [2021-12-06 22:17:39,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 738.875) internal successors, (5911), 8 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:39,099 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:17:39,099 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:17:39,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 22:17:39,100 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:17:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:17:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2042486976, now seen corresponding path program 1 times [2021-12-06 22:17:39,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:17:39,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197267461] [2021-12-06 22:17:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:17:39,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:17:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:17:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:17:39,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:17:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197267461] [2021-12-06 22:17:39,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197267461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:17:39,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:17:39,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:17:39,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597618302] [2021-12-06 22:17:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:17:39,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:17:39,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:17:39,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:17:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:17:39,168 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:17:39,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 1024 transitions, 4983 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:39,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:17:39,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:17:39,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:17:47,775 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([2686] thread1EXIT-->L159-2: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem112#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem112#1=|v_ULTIMATE.start_main_#t~mem112#1_5|} AuxVars[] AssignedVars[][972], [Black: 6516#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0)), Black: 6391#(and (<= (+ ~result_12~0 995) 0) (<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0)), Black: 6512#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|)), Black: 6387#(<= (+ ~result_12~0 995) 0), Black: 6523#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 778#(not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)), Black: 6521#(and (<= 1005 ~result_18~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 3239#(not (= (mod ~is_null_5~0 256) 0)), Black: 776#true, Black: 6407#(and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6503#true, Black: 6410#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 784#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6405#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 788#true, 6406#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6422#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6427#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6423#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 796#(not (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), Black: 6425#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 800#true, 6336#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), Black: 6305#(and (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 3) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 808#(= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0), Black: 6311#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 6537#(and (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)) (= ~is_null_9~0 (* 256 (div ~is_null_9~0 256)))), 2477#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6436#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6318#(= ~break_17~0 0), Black: 6440#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6435#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 4392#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (and (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= (mod ~is_null_5~0 256) 0))) (or (and (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), 6462#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), 487#L123-4true, Black: 4395#(and (or (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 6323#(= ~break_14~0 0), Black: 820#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 0)), Black: 6433#true, Black: 4398#(and (or (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (= 1 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|)) (= (mod ~is_null_5~0 256) 0)), Black: 4210#(= (mod ~is_null_5~0 256) 0), Black: 6328#(= ~break_20~0 0), Black: 2491#(and (< |ULTIMATE.start_create_fresh_bool_array_~i~0#1| |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), 802#(not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6360#(or (and (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 2485#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|) (<= |ULTIMATE.start_create_fresh_bool_array_~i~0#1| 1)), Black: 6458#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 773#true, Black: 6464#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6335#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6460#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6333#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 3450#true, Black: 6338#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 6331#true, 6350#(or (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), 498#L96-4true, Black: 6475#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), Black: 6473#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6477#(and (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)))), Black: 6351#(and (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0))), 693#L159-2true, 6285#(and (<= 5 |ULTIMATE.start_create_fresh_bool_array_#in~size#1|) (<= 5 |ULTIMATE.start_create_fresh_bool_array_~size#1|)), Black: 6357#true, 6472#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6359#(or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0)) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))), Black: 6491#(and (<= (+ ~result_15~0 995) 0) (<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0)), Black: 6486#(<= (+ ~result_15~0 995) 0), Black: 6485#(<= (+ |thread2Thread1of1ForFork0_#t~ite56#1| 995) 0), Black: 6373#(= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0), Black: 6374#(and (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)), 6443#(and (or (= (* 256 (div ~is_null_5~0 256)) ~is_null_5~0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0))) (or (= |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0) (not (= (* 256 (div ~is_null_1~0 256)) ~is_null_1~0)))), Black: 3443#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0)) (= |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), Black: 3438#(and (= 0 |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1|) (not (= (mod ~is_null_5~0 256) 0))), Black: 6505#(<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|), Black: 6386#(<= (+ |thread1Thread1of1ForFork2_#t~ite28#1| 995) 0), Black: 6507#(<= 1005 ~result_18~0), Black: 6514#(and (<= 1005 |thread3Thread1of1ForFork1_#t~ite84#1|) (<= 1005 |thread3Thread1of1ForFork1_#t~ite83#1|) (<= 1005 ~result_18~0))]) [2021-12-06 22:17:47,775 INFO L384 tUnfolder$Statistics]: this new event has 383 ancestors and is cut-off event [2021-12-06 22:17:47,775 INFO L387 tUnfolder$Statistics]: existing Event has 383 ancestors and is cut-off event [2021-12-06 22:17:47,775 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2021-12-06 22:17:47,775 INFO L387 tUnfolder$Statistics]: existing Event has 335 ancestors and is cut-off event [2021-12-06 22:17:50,540 INFO L129 PetriNetUnfolder]: 4018/39684 cut-off events. [2021-12-06 22:17:50,540 INFO L130 PetriNetUnfolder]: For 117653/124569 co-relation queries the response was YES. [2021-12-06 22:17:51,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76394 conditions, 39684 events. 4018/39684 cut-off events. For 117653/124569 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 567835 event pairs, 1094 based on Foata normal form. 230/37513 useless extension candidates. Maximal degree in co-relation 76319. Up to 2163 conditions per place. [2021-12-06 22:17:51,526 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 92 selfloop transitions, 27 changer transitions 34/1069 dead transitions. [2021-12-06 22:17:51,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 909 places, 1069 transitions, 5623 flow [2021-12-06 22:17:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:17:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:17:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3990 transitions. [2021-12-06 22:17:51,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9377203290246768 [2021-12-06 22:17:51,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3990 transitions. [2021-12-06 22:17:51,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3990 transitions. [2021-12-06 22:17:51,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:17:51,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3990 transitions. [2021-12-06 22:17:51,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.0) internal successors, (3990), 5 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:51,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:51,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:51,534 INFO L186 Difference]: Start difference. First operand has 907 places, 1024 transitions, 4983 flow. Second operand 5 states and 3990 transitions. [2021-12-06 22:17:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 909 places, 1069 transitions, 5623 flow [2021-12-06 22:17:52,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1069 transitions, 5614 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-12-06 22:17:52,377 INFO L242 Difference]: Finished difference. Result has 908 places, 1010 transitions, 4784 flow [2021-12-06 22:17:52,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4974, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4784, PETRI_PLACES=908, PETRI_TRANSITIONS=1010} [2021-12-06 22:17:52,379 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 152 predicate places. [2021-12-06 22:17:52,379 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 1010 transitions, 4784 flow [2021-12-06 22:17:52,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:52,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:17:52,379 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:17:52,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 22:17:52,380 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:17:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:17:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash 654373954, now seen corresponding path program 2 times [2021-12-06 22:17:52,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:17:52,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316096018] [2021-12-06 22:17:52,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:17:52,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:17:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:17:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:17:52,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:17:52,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316096018] [2021-12-06 22:17:52,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316096018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:17:52,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:17:52,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:17:52,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469910670] [2021-12-06 22:17:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:17:52,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:17:52,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:17:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:17:52,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:17:52,441 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:17:52,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 1010 transitions, 4784 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:17:52,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:17:52,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:17:52,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:18:02,263 INFO L129 PetriNetUnfolder]: 3510/33096 cut-off events. [2021-12-06 22:18:02,263 INFO L130 PetriNetUnfolder]: For 146259/157774 co-relation queries the response was YES. [2021-12-06 22:18:02,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69504 conditions, 33096 events. 3510/33096 cut-off events. For 146259/157774 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 467131 event pairs, 597 based on Foata normal form. 606/31882 useless extension candidates. Maximal degree in co-relation 69428. Up to 1479 conditions per place. [2021-12-06 22:18:03,109 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 118 selfloop transitions, 46 changer transitions 13/1093 dead transitions. [2021-12-06 22:18:03,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 911 places, 1093 transitions, 6219 flow [2021-12-06 22:18:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:18:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:18:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2021-12-06 22:18:03,111 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2021-12-06 22:18:03,111 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2021-12-06 22:18:03,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2021-12-06 22:18:03,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:18:03,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2021-12-06 22:18:03,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:03,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:03,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:03,116 INFO L186 Difference]: Start difference. First operand has 908 places, 1010 transitions, 4784 flow. Second operand 5 states and 4006 transitions. [2021-12-06 22:18:03,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 911 places, 1093 transitions, 6219 flow [2021-12-06 22:18:04,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 1093 transitions, 6061 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-12-06 22:18:04,055 INFO L242 Difference]: Finished difference. Result has 909 places, 1034 transitions, 5380 flow [2021-12-06 22:18:04,056 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=4684, PETRI_DIFFERENCE_MINUEND_PLACES=901, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5380, PETRI_PLACES=909, PETRI_TRANSITIONS=1034} [2021-12-06 22:18:04,056 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 153 predicate places. [2021-12-06 22:18:04,056 INFO L470 AbstractCegarLoop]: Abstraction has has 909 places, 1034 transitions, 5380 flow [2021-12-06 22:18:04,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:04,057 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:18:04,057 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:04,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 22:18:04,057 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:18:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:18:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash -203898288, now seen corresponding path program 3 times [2021-12-06 22:18:04,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:18:04,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512878945] [2021-12-06 22:18:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:18:04,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:18:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:18:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:18:04,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:18:04,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512878945] [2021-12-06 22:18:04,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512878945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:18:04,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:18:04,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:18:04,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713548749] [2021-12-06 22:18:04,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:18:04,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:18:04,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:18:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:18:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:18:04,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:18:04,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 909 places, 1034 transitions, 5380 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:04,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:18:04,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:18:04,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:18:16,017 INFO L129 PetriNetUnfolder]: 3917/40555 cut-off events. [2021-12-06 22:18:16,017 INFO L130 PetriNetUnfolder]: For 152315/167837 co-relation queries the response was YES. [2021-12-06 22:18:16,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77886 conditions, 40555 events. 3917/40555 cut-off events. For 152315/167837 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 586792 event pairs, 740 based on Foata normal form. 1034/39172 useless extension candidates. Maximal degree in co-relation 77810. Up to 1530 conditions per place. [2021-12-06 22:18:17,002 INFO L132 encePairwiseOnDemand]: 838/851 looper letters, 140 selfloop transitions, 49 changer transitions 24/1129 dead transitions. [2021-12-06 22:18:17,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 1129 transitions, 7081 flow [2021-12-06 22:18:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:18:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:18:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4010 transitions. [2021-12-06 22:18:17,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9424206815511164 [2021-12-06 22:18:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4010 transitions. [2021-12-06 22:18:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4010 transitions. [2021-12-06 22:18:17,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:18:17,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4010 transitions. [2021-12-06 22:18:17,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 802.0) internal successors, (4010), 5 states have internal predecessors, (4010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:17,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:17,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:17,010 INFO L186 Difference]: Start difference. First operand has 909 places, 1034 transitions, 5380 flow. Second operand 5 states and 4010 transitions. [2021-12-06 22:18:17,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 1129 transitions, 7081 flow [2021-12-06 22:18:17,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 1129 transitions, 7075 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-06 22:18:17,857 INFO L242 Difference]: Finished difference. Result has 917 places, 1051 transitions, 5927 flow [2021-12-06 22:18:17,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5376, PETRI_DIFFERENCE_MINUEND_PLACES=909, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5927, PETRI_PLACES=917, PETRI_TRANSITIONS=1051} [2021-12-06 22:18:17,858 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 161 predicate places. [2021-12-06 22:18:17,858 INFO L470 AbstractCegarLoop]: Abstraction has has 917 places, 1051 transitions, 5927 flow [2021-12-06 22:18:17,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:17,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:18:17,859 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:17,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-06 22:18:17,859 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:18:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:18:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 582216258, now seen corresponding path program 4 times [2021-12-06 22:18:17,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:18:17,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665079409] [2021-12-06 22:18:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:18:17,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:18:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:18:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:18:17,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:18:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665079409] [2021-12-06 22:18:17,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665079409] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:18:17,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:18:17,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:18:17,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150467914] [2021-12-06 22:18:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:18:17,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:18:17,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:18:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:18:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:18:17,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:18:17,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 1051 transitions, 5927 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:17,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:18:17,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:18:17,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:18:29,630 INFO L129 PetriNetUnfolder]: 3729/38781 cut-off events. [2021-12-06 22:18:29,630 INFO L130 PetriNetUnfolder]: For 164374/182131 co-relation queries the response was YES. [2021-12-06 22:18:30,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77305 conditions, 38781 events. 3729/38781 cut-off events. For 164374/182131 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 556581 event pairs, 718 based on Foata normal form. 525/37031 useless extension candidates. Maximal degree in co-relation 77225. Up to 1395 conditions per place. [2021-12-06 22:18:30,664 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 126 selfloop transitions, 40 changer transitions 2/1084 dead transitions. [2021-12-06 22:18:30,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 1084 transitions, 6434 flow [2021-12-06 22:18:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:18:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 22:18:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3200 transitions. [2021-12-06 22:18:30,667 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9400705052878966 [2021-12-06 22:18:30,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3200 transitions. [2021-12-06 22:18:30,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3200 transitions. [2021-12-06 22:18:30,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:18:30,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3200 transitions. [2021-12-06 22:18:30,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.0) internal successors, (3200), 4 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:30,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:30,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:30,672 INFO L186 Difference]: Start difference. First operand has 917 places, 1051 transitions, 5927 flow. Second operand 4 states and 3200 transitions. [2021-12-06 22:18:30,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 1084 transitions, 6434 flow [2021-12-06 22:18:31,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 1084 transitions, 6388 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-12-06 22:18:31,649 INFO L242 Difference]: Finished difference. Result has 921 places, 1052 transitions, 6041 flow [2021-12-06 22:18:31,650 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=5884, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6041, PETRI_PLACES=921, PETRI_TRANSITIONS=1052} [2021-12-06 22:18:31,650 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 165 predicate places. [2021-12-06 22:18:31,650 INFO L470 AbstractCegarLoop]: Abstraction has has 921 places, 1052 transitions, 6041 flow [2021-12-06 22:18:31,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:31,651 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:18:31,651 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:31,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 22:18:31,651 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:18:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:18:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 499597566, now seen corresponding path program 1 times [2021-12-06 22:18:31,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:18:31,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747702078] [2021-12-06 22:18:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:18:31,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:18:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:18:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:18:31,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:18:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747702078] [2021-12-06 22:18:31,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747702078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:18:31,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:18:31,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:18:31,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667738072] [2021-12-06 22:18:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:18:31,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:18:31,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:18:31,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:18:31,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:18:31,717 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:18:31,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 1052 transitions, 6041 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:31,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:18:31,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:18:31,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:18:43,549 INFO L129 PetriNetUnfolder]: 3902/39029 cut-off events. [2021-12-06 22:18:43,549 INFO L130 PetriNetUnfolder]: For 176578/191838 co-relation queries the response was YES. [2021-12-06 22:18:44,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78936 conditions, 39029 events. 3902/39029 cut-off events. For 176578/191838 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 559885 event pairs, 720 based on Foata normal form. 660/37406 useless extension candidates. Maximal degree in co-relation 78855. Up to 1390 conditions per place. [2021-12-06 22:18:44,537 INFO L132 encePairwiseOnDemand]: 844/851 looper letters, 143 selfloop transitions, 30 changer transitions 20/1109 dead transitions. [2021-12-06 22:18:44,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 1109 transitions, 7261 flow [2021-12-06 22:18:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:18:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 22:18:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3201 transitions. [2021-12-06 22:18:44,540 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9403642773207991 [2021-12-06 22:18:44,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3201 transitions. [2021-12-06 22:18:44,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3201 transitions. [2021-12-06 22:18:44,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:18:44,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3201 transitions. [2021-12-06 22:18:44,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 800.25) internal successors, (3201), 4 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:44,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:44,544 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:44,544 INFO L186 Difference]: Start difference. First operand has 921 places, 1052 transitions, 6041 flow. Second operand 4 states and 3201 transitions. [2021-12-06 22:18:44,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 1109 transitions, 7261 flow [2021-12-06 22:18:45,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 1109 transitions, 7257 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-12-06 22:18:45,539 INFO L242 Difference]: Finished difference. Result has 927 places, 1055 transitions, 6225 flow [2021-12-06 22:18:45,540 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6225, PETRI_PLACES=927, PETRI_TRANSITIONS=1055} [2021-12-06 22:18:45,540 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 171 predicate places. [2021-12-06 22:18:45,540 INFO L470 AbstractCegarLoop]: Abstraction has has 927 places, 1055 transitions, 6225 flow [2021-12-06 22:18:45,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:45,541 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:18:45,541 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:18:45,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 22:18:45,541 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:18:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:18:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -712975400, now seen corresponding path program 2 times [2021-12-06 22:18:45,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:18:45,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780418146] [2021-12-06 22:18:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:18:45,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:18:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:18:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:18:45,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:18:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780418146] [2021-12-06 22:18:45,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780418146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:18:45,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:18:45,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:18:45,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628088921] [2021-12-06 22:18:45,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:18:45,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:18:45,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:18:45,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:18:45,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:18:45,605 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:18:45,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 1055 transitions, 6225 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:18:45,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:18:45,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:18:45,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:18:59,403 INFO L129 PetriNetUnfolder]: 4182/46385 cut-off events. [2021-12-06 22:18:59,404 INFO L130 PetriNetUnfolder]: For 218429/235687 co-relation queries the response was YES. [2021-12-06 22:19:00,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87731 conditions, 46385 events. 4182/46385 cut-off events. For 218429/235687 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 680463 event pairs, 1029 based on Foata normal form. 506/44034 useless extension candidates. Maximal degree in co-relation 87647. Up to 2472 conditions per place. [2021-12-06 22:19:00,610 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 129 selfloop transitions, 40 changer transitions 11/1096 dead transitions. [2021-12-06 22:19:00,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 1096 transitions, 6818 flow [2021-12-06 22:19:00,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:19:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3991 transitions. [2021-12-06 22:19:00,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379553466509988 [2021-12-06 22:19:00,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3991 transitions. [2021-12-06 22:19:00,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3991 transitions. [2021-12-06 22:19:00,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:19:00,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3991 transitions. [2021-12-06 22:19:00,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 798.2) internal successors, (3991), 5 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:00,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:00,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:00,618 INFO L186 Difference]: Start difference. First operand has 927 places, 1055 transitions, 6225 flow. Second operand 5 states and 3991 transitions. [2021-12-06 22:19:00,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 1096 transitions, 6818 flow [2021-12-06 22:19:01,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 1096 transitions, 6818 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 22:19:01,614 INFO L242 Difference]: Finished difference. Result has 934 places, 1057 transitions, 6376 flow [2021-12-06 22:19:01,615 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6225, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6376, PETRI_PLACES=934, PETRI_TRANSITIONS=1057} [2021-12-06 22:19:01,615 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 178 predicate places. [2021-12-06 22:19:01,615 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 1057 transitions, 6376 flow [2021-12-06 22:19:01,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:01,615 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:19:01,616 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:01,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-06 22:19:01,616 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:19:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash 862920256, now seen corresponding path program 3 times [2021-12-06 22:19:01,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:19:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328007954] [2021-12-06 22:19:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:01,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:19:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:19:01,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:19:01,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328007954] [2021-12-06 22:19:01,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328007954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:01,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:01,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:01,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205656775] [2021-12-06 22:19:01,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:01,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:01,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:19:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:01,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:19:01,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 1057 transitions, 6376 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:01,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:19:01,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:19:01,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:19:14,585 INFO L129 PetriNetUnfolder]: 3761/42128 cut-off events. [2021-12-06 22:19:14,586 INFO L130 PetriNetUnfolder]: For 248281/268563 co-relation queries the response was YES. [2021-12-06 22:19:15,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83972 conditions, 42128 events. 3761/42128 cut-off events. For 248281/268563 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 618743 event pairs, 1037 based on Foata normal form. 487/40193 useless extension candidates. Maximal degree in co-relation 83884. Up to 2209 conditions per place. [2021-12-06 22:19:15,742 INFO L132 encePairwiseOnDemand]: 846/851 looper letters, 115 selfloop transitions, 49 changer transitions 13/1093 dead transitions. [2021-12-06 22:19:15,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 1093 transitions, 6915 flow [2021-12-06 22:19:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:19:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2021-12-06 22:19:15,745 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2021-12-06 22:19:15,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2021-12-06 22:19:15,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2021-12-06 22:19:15,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:19:15,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2021-12-06 22:19:15,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:15,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:15,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:15,750 INFO L186 Difference]: Start difference. First operand has 934 places, 1057 transitions, 6376 flow. Second operand 5 states and 3989 transitions. [2021-12-06 22:19:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 1093 transitions, 6915 flow [2021-12-06 22:19:17,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 1093 transitions, 6837 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-12-06 22:19:17,033 INFO L242 Difference]: Finished difference. Result has 939 places, 1057 transitions, 6437 flow [2021-12-06 22:19:17,033 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6298, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6437, PETRI_PLACES=939, PETRI_TRANSITIONS=1057} [2021-12-06 22:19:17,034 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 183 predicate places. [2021-12-06 22:19:17,034 INFO L470 AbstractCegarLoop]: Abstraction has has 939 places, 1057 transitions, 6437 flow [2021-12-06 22:19:17,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:17,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:19:17,034 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:17,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-06 22:19:17,035 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:19:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1232968302, now seen corresponding path program 4 times [2021-12-06 22:19:17,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:19:17,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223885791] [2021-12-06 22:19:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:17,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:19:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:19:17,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:19:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223885791] [2021-12-06 22:19:17,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223885791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:17,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:17,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:17,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515642291] [2021-12-06 22:19:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:17,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:17,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:19:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:17,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:19:17,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 1057 transitions, 6437 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:17,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:19:17,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:19:17,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:19:29,155 INFO L129 PetriNetUnfolder]: 3519/37563 cut-off events. [2021-12-06 22:19:29,155 INFO L130 PetriNetUnfolder]: For 274958/302299 co-relation queries the response was YES. [2021-12-06 22:19:30,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80098 conditions, 37563 events. 3519/37563 cut-off events. For 274958/302299 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 547857 event pairs, 547 based on Foata normal form. 1497/37049 useless extension candidates. Maximal degree in co-relation 80007. Up to 1472 conditions per place. [2021-12-06 22:19:30,251 INFO L132 encePairwiseOnDemand]: 837/851 looper letters, 164 selfloop transitions, 48 changer transitions 15/1143 dead transitions. [2021-12-06 22:19:30,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 1143 transitions, 7983 flow [2021-12-06 22:19:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:19:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4002 transitions. [2021-12-06 22:19:30,253 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2021-12-06 22:19:30,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4002 transitions. [2021-12-06 22:19:30,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4002 transitions. [2021-12-06 22:19:30,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:19:30,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4002 transitions. [2021-12-06 22:19:30,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 800.4) internal successors, (4002), 5 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:30,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:30,258 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:30,259 INFO L186 Difference]: Start difference. First operand has 939 places, 1057 transitions, 6437 flow. Second operand 5 states and 4002 transitions. [2021-12-06 22:19:30,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 1143 transitions, 7983 flow [2021-12-06 22:19:31,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 1143 transitions, 7889 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-12-06 22:19:31,566 INFO L242 Difference]: Finished difference. Result has 944 places, 1076 transitions, 6963 flow [2021-12-06 22:19:31,566 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6353, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6963, PETRI_PLACES=944, PETRI_TRANSITIONS=1076} [2021-12-06 22:19:31,567 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 188 predicate places. [2021-12-06 22:19:31,567 INFO L470 AbstractCegarLoop]: Abstraction has has 944 places, 1076 transitions, 6963 flow [2021-12-06 22:19:31,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:31,567 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:19:31,568 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:31,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-06 22:19:31,568 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:19:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 13610576, now seen corresponding path program 5 times [2021-12-06 22:19:31,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:19:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583766412] [2021-12-06 22:19:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:31,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:19:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:19:31,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:19:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583766412] [2021-12-06 22:19:31,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583766412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:31,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:31,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:31,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383024586] [2021-12-06 22:19:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:31,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:31,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:19:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:31,633 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:19:31,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 1076 transitions, 6963 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:31,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:19:31,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:19:31,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:19:44,981 INFO L129 PetriNetUnfolder]: 3835/42373 cut-off events. [2021-12-06 22:19:44,982 INFO L130 PetriNetUnfolder]: For 285346/313489 co-relation queries the response was YES. [2021-12-06 22:19:46,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85507 conditions, 42373 events. 3835/42373 cut-off events. For 285346/313489 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 618626 event pairs, 651 based on Foata normal form. 1604/41539 useless extension candidates. Maximal degree in co-relation 85413. Up to 1447 conditions per place. [2021-12-06 22:19:46,191 INFO L132 encePairwiseOnDemand]: 839/851 looper letters, 165 selfloop transitions, 57 changer transitions 9/1147 dead transitions. [2021-12-06 22:19:46,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1147 transitions, 8095 flow [2021-12-06 22:19:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:19:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:19:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4006 transitions. [2021-12-06 22:19:46,194 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9414806110458285 [2021-12-06 22:19:46,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 4006 transitions. [2021-12-06 22:19:46,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 4006 transitions. [2021-12-06 22:19:46,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:19:46,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 4006 transitions. [2021-12-06 22:19:46,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 801.2) internal successors, (4006), 5 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:46,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:46,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:46,199 INFO L186 Difference]: Start difference. First operand has 944 places, 1076 transitions, 6963 flow. Second operand 5 states and 4006 transitions. [2021-12-06 22:19:46,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 1147 transitions, 8095 flow [2021-12-06 22:19:47,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 948 places, 1147 transitions, 8069 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-12-06 22:19:47,566 INFO L242 Difference]: Finished difference. Result has 952 places, 1088 transitions, 7398 flow [2021-12-06 22:19:47,567 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=6887, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7398, PETRI_PLACES=952, PETRI_TRANSITIONS=1088} [2021-12-06 22:19:47,567 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 196 predicate places. [2021-12-06 22:19:47,567 INFO L470 AbstractCegarLoop]: Abstraction has has 952 places, 1088 transitions, 7398 flow [2021-12-06 22:19:47,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:47,567 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:19:47,568 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:19:47,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-06 22:19:47,568 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:19:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:19:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash 993155130, now seen corresponding path program 6 times [2021-12-06 22:19:47,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:19:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823725546] [2021-12-06 22:19:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:19:47,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:19:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:19:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:19:47,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:19:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823725546] [2021-12-06 22:19:47,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823725546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:19:47,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:19:47,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:19:47,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209285650] [2021-12-06 22:19:47,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:19:47,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:19:47,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:19:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:19:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:19:47,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:19:47,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 1088 transitions, 7398 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:19:47,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:19:47,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:19:47,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:20:00,996 INFO L129 PetriNetUnfolder]: 3828/41448 cut-off events. [2021-12-06 22:20:00,997 INFO L130 PetriNetUnfolder]: For 319949/350046 co-relation queries the response was YES. [2021-12-06 22:20:02,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85690 conditions, 41448 events. 3828/41448 cut-off events. For 319949/350046 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 601600 event pairs, 948 based on Foata normal form. 1394/40439 useless extension candidates. Maximal degree in co-relation 85592. Up to 2399 conditions per place. [2021-12-06 22:20:02,270 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 46 changer transitions 6/1123 dead transitions. [2021-12-06 22:20:02,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 1123 transitions, 8034 flow [2021-12-06 22:20:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 22:20:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2021-12-06 22:20:02,272 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2021-12-06 22:20:02,272 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2021-12-06 22:20:02,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2021-12-06 22:20:02,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:20:02,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2021-12-06 22:20:02,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:02,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:02,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:02,276 INFO L186 Difference]: Start difference. First operand has 952 places, 1088 transitions, 7398 flow. Second operand 4 states and 3199 transitions. [2021-12-06 22:20:02,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 1123 transitions, 8034 flow [2021-12-06 22:20:03,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 1123 transitions, 7985 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-12-06 22:20:03,648 INFO L242 Difference]: Finished difference. Result has 954 places, 1087 transitions, 7422 flow [2021-12-06 22:20:03,648 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7330, PETRI_DIFFERENCE_MINUEND_PLACES=951, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7422, PETRI_PLACES=954, PETRI_TRANSITIONS=1087} [2021-12-06 22:20:03,649 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 198 predicate places. [2021-12-06 22:20:03,649 INFO L470 AbstractCegarLoop]: Abstraction has has 954 places, 1087 transitions, 7422 flow [2021-12-06 22:20:03,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:03,649 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:20:03,650 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:03,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-06 22:20:03,650 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:20:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1985037212, now seen corresponding path program 5 times [2021-12-06 22:20:03,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:20:03,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474355863] [2021-12-06 22:20:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:03,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:20:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:20:03,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:20:03,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474355863] [2021-12-06 22:20:03,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474355863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:03,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:03,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:03,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839998965] [2021-12-06 22:20:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:03,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:03,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:20:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:03,714 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:20:03,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 1087 transitions, 7422 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:03,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:20:03,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:20:03,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:20:19,147 INFO L129 PetriNetUnfolder]: 4217/47713 cut-off events. [2021-12-06 22:20:19,147 INFO L130 PetriNetUnfolder]: For 323729/350891 co-relation queries the response was YES. [2021-12-06 22:20:20,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93396 conditions, 47713 events. 4217/47713 cut-off events. For 323729/350891 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 702743 event pairs, 1043 based on Foata normal form. 429/45246 useless extension candidates. Maximal degree in co-relation 93297. Up to 2748 conditions per place. [2021-12-06 22:20:20,679 INFO L132 encePairwiseOnDemand]: 845/851 looper letters, 165 selfloop transitions, 27 changer transitions 17/1125 dead transitions. [2021-12-06 22:20:20,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 1125 transitions, 8035 flow [2021-12-06 22:20:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:20:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-06 22:20:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3989 transitions. [2021-12-06 22:20:20,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9374853113983549 [2021-12-06 22:20:20,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 3989 transitions. [2021-12-06 22:20:20,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 3989 transitions. [2021-12-06 22:20:20,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:20:20,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 3989 transitions. [2021-12-06 22:20:20,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 797.8) internal successors, (3989), 5 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:20,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:20,687 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 851.0) internal successors, (5106), 6 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:20,687 INFO L186 Difference]: Start difference. First operand has 954 places, 1087 transitions, 7422 flow. Second operand 5 states and 3989 transitions. [2021-12-06 22:20:20,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 1125 transitions, 8035 flow [2021-12-06 22:20:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 1125 transitions, 8001 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:20:22,222 INFO L242 Difference]: Finished difference. Result has 959 places, 1085 transitions, 7379 flow [2021-12-06 22:20:22,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7388, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7379, PETRI_PLACES=959, PETRI_TRANSITIONS=1085} [2021-12-06 22:20:22,223 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2021-12-06 22:20:22,223 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1085 transitions, 7379 flow [2021-12-06 22:20:22,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:22,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:20:22,224 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:22,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-06 22:20:22,224 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:20:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1649567170, now seen corresponding path program 6 times [2021-12-06 22:20:22,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:20:22,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757420532] [2021-12-06 22:20:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:22,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:20:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:20:22,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:20:22,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757420532] [2021-12-06 22:20:22,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757420532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:22,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:22,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 22:20:22,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392779206] [2021-12-06 22:20:22,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:22,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 22:20:22,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:20:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 22:20:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-06 22:20:22,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 783 out of 851 [2021-12-06 22:20:22,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1085 transitions, 7379 flow. Second operand has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:22,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:20:22,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 783 of 851 [2021-12-06 22:20:22,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:20:36,309 INFO L129 PetriNetUnfolder]: 3851/43147 cut-off events. [2021-12-06 22:20:36,309 INFO L130 PetriNetUnfolder]: For 328119/358515 co-relation queries the response was YES. [2021-12-06 22:20:37,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88416 conditions, 43147 events. 3851/43147 cut-off events. For 328119/358515 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 630526 event pairs, 941 based on Foata normal form. 1160/41790 useless extension candidates. Maximal degree in co-relation 88315. Up to 2396 conditions per place. [2021-12-06 22:20:37,589 INFO L132 encePairwiseOnDemand]: 843/851 looper letters, 155 selfloop transitions, 36 changer transitions 12/1119 dead transitions. [2021-12-06 22:20:37,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1119 transitions, 8002 flow [2021-12-06 22:20:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 22:20:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-06 22:20:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3199 transitions. [2021-12-06 22:20:37,591 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9397767332549941 [2021-12-06 22:20:37,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 3199 transitions. [2021-12-06 22:20:37,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 3199 transitions. [2021-12-06 22:20:37,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:20:37,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 3199 transitions. [2021-12-06 22:20:37,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 799.75) internal successors, (3199), 4 states have internal predecessors, (3199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:37,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:37,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 851.0) internal successors, (4255), 5 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:37,596 INFO L186 Difference]: Start difference. First operand has 959 places, 1085 transitions, 7379 flow. Second operand 4 states and 3199 transitions. [2021-12-06 22:20:37,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1119 transitions, 8002 flow [2021-12-06 22:20:39,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 1119 transitions, 7933 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-12-06 22:20:39,153 INFO L242 Difference]: Finished difference. Result has 959 places, 1078 transitions, 7199 flow [2021-12-06 22:20:39,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7284, PETRI_DIFFERENCE_MINUEND_PLACES=956, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7199, PETRI_PLACES=959, PETRI_TRANSITIONS=1078} [2021-12-06 22:20:39,154 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 203 predicate places. [2021-12-06 22:20:39,154 INFO L470 AbstractCegarLoop]: Abstraction has has 959 places, 1078 transitions, 7199 flow [2021-12-06 22:20:39,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 788.25) internal successors, (3153), 4 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:39,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:20:39,155 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:20:39,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-06 22:20:39,155 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:20:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:20:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2120308048, now seen corresponding path program 1 times [2021-12-06 22:20:39,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:20:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888685132] [2021-12-06 22:20:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:20:39,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:20:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:20:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:20:39,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:20:39,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888685132] [2021-12-06 22:20:39,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888685132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:20:39,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:20:39,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:20:39,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870202757] [2021-12-06 22:20:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:20:39,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:20:39,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:20:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:20:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:20:39,325 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:20:39,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 1078 transitions, 7199 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:20:39,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:20:39,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:20:39,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:21:04,336 INFO L129 PetriNetUnfolder]: 9968/76017 cut-off events. [2021-12-06 22:21:04,336 INFO L130 PetriNetUnfolder]: For 579542/639740 co-relation queries the response was YES. [2021-12-06 22:21:06,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172449 conditions, 76017 events. 9968/76017 cut-off events. For 579542/639740 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 1209904 event pairs, 1613 based on Foata normal form. 1647/74686 useless extension candidates. Maximal degree in co-relation 172349. Up to 6506 conditions per place. [2021-12-06 22:21:07,215 INFO L132 encePairwiseOnDemand]: 834/851 looper letters, 354 selfloop transitions, 108 changer transitions 74/1341 dead transitions. [2021-12-06 22:21:07,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 1341 transitions, 12182 flow [2021-12-06 22:21:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:21:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 22:21:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8482 transitions. [2021-12-06 22:21:07,220 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.906099775664993 [2021-12-06 22:21:07,220 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 8482 transitions. [2021-12-06 22:21:07,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 8482 transitions. [2021-12-06 22:21:07,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:21:07,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 8482 transitions. [2021-12-06 22:21:07,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 771.0909090909091) internal successors, (8482), 11 states have internal predecessors, (8482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:07,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:07,232 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 851.0) internal successors, (10212), 12 states have internal predecessors, (10212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:07,232 INFO L186 Difference]: Start difference. First operand has 959 places, 1078 transitions, 7199 flow. Second operand 11 states and 8482 transitions. [2021-12-06 22:21:07,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 1341 transitions, 12182 flow [2021-12-06 22:21:12,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 968 places, 1341 transitions, 12111 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 22:21:12,292 INFO L242 Difference]: Finished difference. Result has 977 places, 1108 transitions, 8590 flow [2021-12-06 22:21:12,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=7101, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=988, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8590, PETRI_PLACES=977, PETRI_TRANSITIONS=1108} [2021-12-06 22:21:12,293 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 221 predicate places. [2021-12-06 22:21:12,293 INFO L470 AbstractCegarLoop]: Abstraction has has 977 places, 1108 transitions, 8590 flow [2021-12-06 22:21:12,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:12,294 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:21:12,294 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:12,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-06 22:21:12,294 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:21:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -212299800, now seen corresponding path program 2 times [2021-12-06 22:21:12,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:12,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576579123] [2021-12-06 22:21:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:12,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:21:12,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:12,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576579123] [2021-12-06 22:21:12,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576579123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:12,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:12,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:21:12,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802898319] [2021-12-06 22:21:12,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:12,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:21:12,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:21:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:21:12,381 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:21:12,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 1108 transitions, 8590 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:12,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:21:12,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:21:12,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 22:21:41,284 INFO L129 PetriNetUnfolder]: 10420/84409 cut-off events. [2021-12-06 22:21:41,284 INFO L130 PetriNetUnfolder]: For 511901/566181 co-relation queries the response was YES. [2021-12-06 22:21:44,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185627 conditions, 84409 events. 10420/84409 cut-off events. For 511901/566181 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 1374969 event pairs, 3280 based on Foata normal form. 867/81455 useless extension candidates. Maximal degree in co-relation 185519. Up to 6015 conditions per place. [2021-12-06 22:21:44,768 INFO L132 encePairwiseOnDemand]: 833/851 looper letters, 325 selfloop transitions, 110 changer transitions 97/1337 dead transitions. [2021-12-06 22:21:44,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 985 places, 1337 transitions, 11729 flow [2021-12-06 22:21:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 22:21:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 22:21:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6950 transitions. [2021-12-06 22:21:44,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9074291682987335 [2021-12-06 22:21:44,773 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 6950 transitions. [2021-12-06 22:21:44,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 6950 transitions. [2021-12-06 22:21:44,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 22:21:44,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 6950 transitions. [2021-12-06 22:21:44,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 772.2222222222222) internal successors, (6950), 9 states have internal predecessors, (6950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:44,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:44,782 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 851.0) internal successors, (8510), 10 states have internal predecessors, (8510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:44,782 INFO L186 Difference]: Start difference. First operand has 977 places, 1108 transitions, 8590 flow. Second operand 9 states and 6950 transitions. [2021-12-06 22:21:44,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 985 places, 1337 transitions, 11729 flow [2021-12-06 22:21:50,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 984 places, 1337 transitions, 11589 flow, removed 59 selfloop flow, removed 1 redundant places. [2021-12-06 22:21:50,276 INFO L242 Difference]: Finished difference. Result has 988 places, 1120 transitions, 8736 flow [2021-12-06 22:21:50,277 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=851, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1019, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8736, PETRI_PLACES=988, PETRI_TRANSITIONS=1120} [2021-12-06 22:21:50,277 INFO L334 CegarLoopForPetriNet]: 756 programPoint places, 232 predicate places. [2021-12-06 22:21:50,277 INFO L470 AbstractCegarLoop]: Abstraction has has 988 places, 1120 transitions, 8736 flow [2021-12-06 22:21:50,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:50,278 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 22:21:50,278 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:21:50,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-06 22:21:50,278 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-06 22:21:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:21:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1953128738, now seen corresponding path program 3 times [2021-12-06 22:21:50,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:21:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651802546] [2021-12-06 22:21:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:21:50,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:21:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:21:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2021-12-06 22:21:50,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:21:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651802546] [2021-12-06 22:21:50,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651802546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:21:50,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:21:50,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:21:50,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060172697] [2021-12-06 22:21:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:21:50,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:21:50,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:21:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:21:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:21:50,375 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 851 [2021-12-06 22:21:50,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1120 transitions, 8736 flow. Second operand has 6 states, 6 states have (on average 752.1666666666666) internal successors, (4513), 6 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 22:21:50,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 22:21:50,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 851 [2021-12-06 22:21:50,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand