./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8ce32899aa465c1eaa89b234122d94aaf792bb347295ccb743670e04bba6b8e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 23:21:32,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 23:21:32,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 23:21:32,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 23:21:32,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 23:21:32,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 23:21:32,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 23:21:32,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 23:21:32,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 23:21:32,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 23:21:32,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 23:21:32,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 23:21:32,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 23:21:32,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 23:21:32,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 23:21:32,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 23:21:32,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 23:21:32,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 23:21:32,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 23:21:32,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 23:21:32,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 23:21:32,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 23:21:32,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 23:21:32,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 23:21:32,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 23:21:32,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 23:21:32,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 23:21:32,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 23:21:32,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 23:21:32,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 23:21:32,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 23:21:32,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 23:21:32,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 23:21:32,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 23:21:32,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 23:21:32,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 23:21:32,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 23:21:32,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 23:21:32,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 23:21:32,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 23:21:32,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 23:21:32,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 23:21:32,897 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 23:21:32,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 23:21:32,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 23:21:32,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 23:21:32,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 23:21:32,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 23:21:32,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 23:21:32,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 23:21:32,899 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 23:21:32,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 23:21:32,899 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 23:21:32,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 23:21:32,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 23:21:32,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 23:21:32,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 23:21:32,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 23:21:32,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 23:21:32,901 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 23:21:32,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 23:21:32,901 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 23:21:32,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 23:21:32,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 23:21:32,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 23:21:32,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 23:21:32,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:21:32,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 23:21:32,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 23:21:32,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 23:21:32,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 23:21:32,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8ce32899aa465c1eaa89b234122d94aaf792bb347295ccb743670e04bba6b8e [2021-12-17 23:21:33,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 23:21:33,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 23:21:33,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 23:21:33,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 23:21:33,084 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 23:21:33,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2021-12-17 23:21:33,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899b1382c/cc729656fa104dd1902eaec5782cd746/FLAG246b42115 [2021-12-17 23:21:33,480 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 23:21:33,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2021-12-17 23:21:33,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899b1382c/cc729656fa104dd1902eaec5782cd746/FLAG246b42115 [2021-12-17 23:21:33,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899b1382c/cc729656fa104dd1902eaec5782cd746 [2021-12-17 23:21:33,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 23:21:33,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 23:21:33,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 23:21:33,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 23:21:33,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 23:21:33,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d9efc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33, skipping insertion in model container [2021-12-17 23:21:33,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 23:21:33,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 23:21:33,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c[2644,2657] [2021-12-17 23:21:33,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:21:33,660 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 23:21:33,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c[2644,2657] [2021-12-17 23:21:33,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 23:21:33,685 INFO L208 MainTranslator]: Completed translation [2021-12-17 23:21:33,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33 WrapperNode [2021-12-17 23:21:33,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 23:21:33,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 23:21:33,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 23:21:33,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 23:21:33,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,712 INFO L137 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 164 [2021-12-17 23:21:33,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 23:21:33,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 23:21:33,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 23:21:33,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 23:21:33,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 23:21:33,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 23:21:33,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 23:21:33,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 23:21:33,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (1/1) ... [2021-12-17 23:21:33,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 23:21:33,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:21:33,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 23:21:33,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 23:21:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 23:21:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 23:21:33,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 23:21:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 23:21:33,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 23:21:33,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 23:21:33,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 23:21:33,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 23:21:33,799 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 23:21:33,867 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 23:21:33,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 23:21:34,059 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 23:21:34,068 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 23:21:34,068 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 23:21:34,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:21:34 BoogieIcfgContainer [2021-12-17 23:21:34,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 23:21:34,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 23:21:34,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 23:21:34,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 23:21:34,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:21:33" (1/3) ... [2021-12-17 23:21:34,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d44921b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:21:34, skipping insertion in model container [2021-12-17 23:21:34,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:21:33" (2/3) ... [2021-12-17 23:21:34,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d44921b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:21:34, skipping insertion in model container [2021-12-17 23:21:34,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:21:34" (3/3) ... [2021-12-17 23:21:34,075 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2021-12-17 23:21:34,078 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 23:21:34,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 23:21:34,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 23:21:34,078 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 23:21:34,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,119 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,120 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,126 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,143 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,153 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 23:21:34,170 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-17 23:21:34,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 23:21:34,212 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 23:21:34,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-17 23:21:34,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 213 transitions, 442 flow [2021-12-17 23:21:34,323 INFO L129 PetriNetUnfolder]: 17/211 cut-off events. [2021-12-17 23:21:34,323 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 23:21:34,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 211 events. 17/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 178 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2021-12-17 23:21:34,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 213 transitions, 442 flow [2021-12-17 23:21:34,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 202 transitions, 416 flow [2021-12-17 23:21:34,399 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2021-12-17 23:21:34,403 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 23:21:34,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:34,404 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] [2021-12-17 23:21:34,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1815692484, now seen corresponding path program 1 times [2021-12-17 23:21:34,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:34,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602221960] [2021-12-17 23:21:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:34,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:21:34,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602221960] [2021-12-17 23:21:34,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602221960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:34,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:34,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 23:21:34,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267009439] [2021-12-17 23:21:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:34,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 23:21:34,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 23:21:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 23:21:34,578 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 213 [2021-12-17 23:21:34,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 202 transitions, 416 flow. Second operand has 2 states, 2 states have (on average 196.5) internal successors, (393), 2 states have internal predecessors, (393), 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-17 23:21:34,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:34,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 213 [2021-12-17 23:21:34,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:34,610 INFO L129 PetriNetUnfolder]: 3/188 cut-off events. [2021-12-17 23:21:34,611 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-12-17 23:21:34,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 188 events. 3/188 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 17/191 useless extension candidates. Maximal degree in co-relation 104. Up to 5 conditions per place. [2021-12-17 23:21:34,613 INFO L132 encePairwiseOnDemand]: 199/213 looper letters, 4 selfloop transitions, 0 changer transitions 5/188 dead transitions. [2021-12-17 23:21:34,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 188 transitions, 396 flow [2021-12-17 23:21:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 23:21:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 23:21:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 406 transitions. [2021-12-17 23:21:34,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9530516431924883 [2021-12-17 23:21:34,623 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 406 transitions. [2021-12-17 23:21:34,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 406 transitions. [2021-12-17 23:21:34,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:34,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 406 transitions. [2021-12-17 23:21:34,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.0) internal successors, (406), 2 states have internal predecessors, (406), 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-17 23:21:34,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-17 23:21:34,632 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-17 23:21:34,633 INFO L186 Difference]: Start difference. First operand has 192 places, 202 transitions, 416 flow. Second operand 2 states and 406 transitions. [2021-12-17 23:21:34,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 188 transitions, 396 flow [2021-12-17 23:21:34,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 188 transitions, 388 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 23:21:34,639 INFO L242 Difference]: Finished difference. Result has 189 places, 183 transitions, 370 flow [2021-12-17 23:21:34,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=370, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2021-12-17 23:21:34,642 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, -3 predicate places. [2021-12-17 23:21:34,643 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 370 flow [2021-12-17 23:21:34,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 196.5) internal successors, (393), 2 states have internal predecessors, (393), 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-17 23:21:34,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:34,643 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] [2021-12-17 23:21:34,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 23:21:34,644 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash 849220131, now seen corresponding path program 1 times [2021-12-17 23:21:34,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857115900] [2021-12-17 23:21:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:34,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:21:34,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:34,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857115900] [2021-12-17 23:21:34,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857115900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:34,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:34,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 23:21:34,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381614881] [2021-12-17 23:21:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:34,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:21:34,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:34,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:21:34,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:21:34,886 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 213 [2021-12-17 23:21:34,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-17 23:21:34,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:34,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 213 [2021-12-17 23:21:34,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:35,055 INFO L129 PetriNetUnfolder]: 28/385 cut-off events. [2021-12-17 23:21:35,055 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-12-17 23:21:35,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 385 events. 28/385 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 969 event pairs, 11 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 470. Up to 70 conditions per place. [2021-12-17 23:21:35,060 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 39 selfloop transitions, 7 changer transitions 0/187 dead transitions. [2021-12-17 23:21:35,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 470 flow [2021-12-17 23:21:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 23:21:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-17 23:21:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1255 transitions. [2021-12-17 23:21:35,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7365023474178404 [2021-12-17 23:21:35,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1255 transitions. [2021-12-17 23:21:35,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1255 transitions. [2021-12-17 23:21:35,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:35,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1255 transitions. [2021-12-17 23:21:35,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.875) internal successors, (1255), 8 states have internal predecessors, (1255), 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-17 23:21:35,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 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-17 23:21:35,077 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 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-17 23:21:35,077 INFO L186 Difference]: Start difference. First operand has 189 places, 183 transitions, 370 flow. Second operand 8 states and 1255 transitions. [2021-12-17 23:21:35,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 470 flow [2021-12-17 23:21:35,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 187 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:21:35,083 INFO L242 Difference]: Finished difference. Result has 192 places, 184 transitions, 392 flow [2021-12-17 23:21:35,083 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=392, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2021-12-17 23:21:35,084 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 0 predicate places. [2021-12-17 23:21:35,084 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 392 flow [2021-12-17 23:21:35,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 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-17 23:21:35,085 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:35,085 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] [2021-12-17 23:21:35,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 23:21:35,086 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 975416349, now seen corresponding path program 1 times [2021-12-17 23:21:35,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966508870] [2021-12-17 23:21:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:35,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:35,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:35,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966508870] [2021-12-17 23:21:35,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966508870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:35,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:35,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:21:35,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675305337] [2021-12-17 23:21:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:35,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:21:35,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:21:35,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:21:35,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 213 [2021-12-17 23:21:35,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 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-17 23:21:35,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:35,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 213 [2021-12-17 23:21:35,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:35,485 INFO L129 PetriNetUnfolder]: 145/915 cut-off events. [2021-12-17 23:21:35,485 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-12-17 23:21:35,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 915 events. 145/915 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5108 event pairs, 47 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1250. Up to 160 conditions per place. [2021-12-17 23:21:35,490 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 71 selfloop transitions, 5 changer transitions 4/220 dead transitions. [2021-12-17 23:21:35,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 220 transitions, 629 flow [2021-12-17 23:21:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:21:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 23:21:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 975 transitions. [2021-12-17 23:21:35,492 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7629107981220657 [2021-12-17 23:21:35,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 975 transitions. [2021-12-17 23:21:35,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 975 transitions. [2021-12-17 23:21:35,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:35,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 975 transitions. [2021-12-17 23:21:35,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.5) internal successors, (975), 6 states have internal predecessors, (975), 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-17 23:21:35,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:35,497 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:35,497 INFO L186 Difference]: Start difference. First operand has 192 places, 184 transitions, 392 flow. Second operand 6 states and 975 transitions. [2021-12-17 23:21:35,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 220 transitions, 629 flow [2021-12-17 23:21:35,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 220 transitions, 617 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-17 23:21:35,502 INFO L242 Difference]: Finished difference. Result has 194 places, 187 transitions, 409 flow [2021-12-17 23:21:35,502 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=409, PETRI_PLACES=194, PETRI_TRANSITIONS=187} [2021-12-17 23:21:35,504 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2021-12-17 23:21:35,504 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 187 transitions, 409 flow [2021-12-17 23:21:35,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 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-17 23:21:35,505 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:35,505 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] [2021-12-17 23:21:35,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 23:21:35,506 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1302967288, now seen corresponding path program 1 times [2021-12-17 23:21:35,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:35,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599471227] [2021-12-17 23:21:35,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:35,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:35,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599471227] [2021-12-17 23:21:35,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599471227] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:21:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701186827] [2021-12-17 23:21:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:35,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:21:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:21:35,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:21:35,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 23:21:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:35,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 23:21:35,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:21:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:35,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:21:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:36,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701186827] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 23:21:36,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 23:21:36,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2021-12-17 23:21:36,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236883383] [2021-12-17 23:21:36,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:36,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:21:36,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:21:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-17 23:21:36,103 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 213 [2021-12-17 23:21:36,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 187 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-17 23:21:36,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:36,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 213 [2021-12-17 23:21:36,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:36,214 INFO L129 PetriNetUnfolder]: 128/942 cut-off events. [2021-12-17 23:21:36,214 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-12-17 23:21:36,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 942 events. 128/942 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4964 event pairs, 13 based on Foata normal form. 0/829 useless extension candidates. Maximal degree in co-relation 1233. Up to 175 conditions per place. [2021-12-17 23:21:36,218 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 28 selfloop transitions, 5 changer transitions 1/199 dead transitions. [2021-12-17 23:21:36,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 199 transitions, 505 flow [2021-12-17 23:21:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 23:21:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 23:21:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2021-12-17 23:21:36,220 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8673708920187794 [2021-12-17 23:21:36,220 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2021-12-17 23:21:36,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2021-12-17 23:21:36,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:36,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2021-12-17 23:21:36,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 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-17 23:21:36,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:36,224 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:36,224 INFO L186 Difference]: Start difference. First operand has 194 places, 187 transitions, 409 flow. Second operand 4 states and 739 transitions. [2021-12-17 23:21:36,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 199 transitions, 505 flow [2021-12-17 23:21:36,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 199 transitions, 501 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-17 23:21:36,227 INFO L242 Difference]: Finished difference. Result has 196 places, 191 transitions, 441 flow [2021-12-17 23:21:36,228 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=441, PETRI_PLACES=196, PETRI_TRANSITIONS=191} [2021-12-17 23:21:36,228 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 4 predicate places. [2021-12-17 23:21:36,228 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 191 transitions, 441 flow [2021-12-17 23:21:36,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-17 23:21:36,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:36,229 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] [2021-12-17 23:21:36,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 23:21:36,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:21:36,455 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1873768424, now seen corresponding path program 2 times [2021-12-17 23:21:36,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:36,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623877516] [2021-12-17 23:21:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:36,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:36,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623877516] [2021-12-17 23:21:36,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623877516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:36,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:36,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:21:36,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136906520] [2021-12-17 23:21:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:36,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:21:36,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:36,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:21:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:21:36,503 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 213 [2021-12-17 23:21:36,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 191 transitions, 441 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-17 23:21:36,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:36,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 213 [2021-12-17 23:21:36,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:36,612 INFO L129 PetriNetUnfolder]: 144/1036 cut-off events. [2021-12-17 23:21:36,613 INFO L130 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2021-12-17 23:21:36,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 1036 events. 144/1036 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5387 event pairs, 54 based on Foata normal form. 2/976 useless extension candidates. Maximal degree in co-relation 1514. Up to 221 conditions per place. [2021-12-17 23:21:36,617 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 31 selfloop transitions, 6 changer transitions 0/202 dead transitions. [2021-12-17 23:21:36,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 556 flow [2021-12-17 23:21:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 23:21:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-17 23:21:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 913 transitions. [2021-12-17 23:21:36,619 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8572769953051643 [2021-12-17 23:21:36,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 913 transitions. [2021-12-17 23:21:36,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 913 transitions. [2021-12-17 23:21:36,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:36,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 913 transitions. [2021-12-17 23:21:36,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.6) internal successors, (913), 5 states have internal predecessors, (913), 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-17 23:21:36,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 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-17 23:21:36,623 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 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-17 23:21:36,623 INFO L186 Difference]: Start difference. First operand has 196 places, 191 transitions, 441 flow. Second operand 5 states and 913 transitions. [2021-12-17 23:21:36,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 556 flow [2021-12-17 23:21:36,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 202 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 23:21:36,626 INFO L242 Difference]: Finished difference. Result has 202 places, 193 transitions, 476 flow [2021-12-17 23:21:36,627 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=202, PETRI_TRANSITIONS=193} [2021-12-17 23:21:36,627 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 10 predicate places. [2021-12-17 23:21:36,627 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 193 transitions, 476 flow [2021-12-17 23:21:36,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-17 23:21:36,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:36,628 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] [2021-12-17 23:21:36,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 23:21:36,628 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -760661096, now seen corresponding path program 3 times [2021-12-17 23:21:36,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:36,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775225467] [2021-12-17 23:21:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:36,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:36,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:36,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775225467] [2021-12-17 23:21:36,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775225467] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:21:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479475411] [2021-12-17 23:21:36,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 23:21:36,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:21:36,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:21:36,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:21:36,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 23:21:36,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 23:21:36,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:21:36,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 23:21:36,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:21:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:37,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:21:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:37,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479475411] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:21:37,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:21:37,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2021-12-17 23:21:37,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046488571] [2021-12-17 23:21:37,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:21:37,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 23:21:37,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 23:21:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 23:21:37,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 213 [2021-12-17 23:21:37,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 193 transitions, 476 flow. Second operand has 8 states, 8 states have (on average 176.125) internal successors, (1409), 8 states have internal predecessors, (1409), 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-17 23:21:37,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:37,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 213 [2021-12-17 23:21:37,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:37,432 INFO L129 PetriNetUnfolder]: 279/1926 cut-off events. [2021-12-17 23:21:37,432 INFO L130 PetriNetUnfolder]: For 694/702 co-relation queries the response was YES. [2021-12-17 23:21:37,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 1926 events. 279/1926 cut-off events. For 694/702 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13056 event pairs, 99 based on Foata normal form. 8/1812 useless extension candidates. Maximal degree in co-relation 3012. Up to 392 conditions per place. [2021-12-17 23:21:37,440 INFO L132 encePairwiseOnDemand]: 207/213 looper letters, 62 selfloop transitions, 25 changer transitions 2/251 dead transitions. [2021-12-17 23:21:37,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 251 transitions, 874 flow [2021-12-17 23:21:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 23:21:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 23:21:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1637 transitions. [2021-12-17 23:21:37,443 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8539384454877412 [2021-12-17 23:21:37,443 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1637 transitions. [2021-12-17 23:21:37,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1637 transitions. [2021-12-17 23:21:37,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:37,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1637 transitions. [2021-12-17 23:21:37,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 181.88888888888889) internal successors, (1637), 9 states have internal predecessors, (1637), 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-17 23:21:37,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 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-17 23:21:37,449 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 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-17 23:21:37,449 INFO L186 Difference]: Start difference. First operand has 202 places, 193 transitions, 476 flow. Second operand 9 states and 1637 transitions. [2021-12-17 23:21:37,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 251 transitions, 874 flow [2021-12-17 23:21:37,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 251 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 23:21:37,453 INFO L242 Difference]: Finished difference. Result has 213 places, 216 transitions, 676 flow [2021-12-17 23:21:37,454 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=676, PETRI_PLACES=213, PETRI_TRANSITIONS=216} [2021-12-17 23:21:37,454 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 21 predicate places. [2021-12-17 23:21:37,454 INFO L470 AbstractCegarLoop]: Abstraction has has 213 places, 216 transitions, 676 flow [2021-12-17 23:21:37,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 176.125) internal successors, (1409), 8 states have internal predecessors, (1409), 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-17 23:21:37,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:37,455 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] [2021-12-17 23:21:37,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 23:21:37,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-17 23:21:37,671 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1762707664, now seen corresponding path program 4 times [2021-12-17 23:21:37,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:37,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268538862] [2021-12-17 23:21:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:37,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:37,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:37,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268538862] [2021-12-17 23:21:37,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268538862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:37,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:37,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 23:21:37,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525757540] [2021-12-17 23:21:37,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:37,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 23:21:37,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:37,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 23:21:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-17 23:21:37,736 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 213 [2021-12-17 23:21:37,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 216 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-17 23:21:37,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:37,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 213 [2021-12-17 23:21:37,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:37,952 INFO L129 PetriNetUnfolder]: 276/1875 cut-off events. [2021-12-17 23:21:37,952 INFO L130 PetriNetUnfolder]: For 1201/1201 co-relation queries the response was YES. [2021-12-17 23:21:37,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3211 conditions, 1875 events. 276/1875 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12618 event pairs, 119 based on Foata normal form. 11/1763 useless extension candidates. Maximal degree in co-relation 3194. Up to 418 conditions per place. [2021-12-17 23:21:37,961 INFO L132 encePairwiseOnDemand]: 205/213 looper letters, 56 selfloop transitions, 20 changer transitions 2/240 dead transitions. [2021-12-17 23:21:37,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 240 transitions, 928 flow [2021-12-17 23:21:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:21:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 23:21:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1095 transitions. [2021-12-17 23:21:37,963 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8568075117370892 [2021-12-17 23:21:37,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1095 transitions. [2021-12-17 23:21:37,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1095 transitions. [2021-12-17 23:21:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:37,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1095 transitions. [2021-12-17 23:21:37,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.5) internal successors, (1095), 6 states have internal predecessors, (1095), 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-17 23:21:37,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:37,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:37,967 INFO L186 Difference]: Start difference. First operand has 213 places, 216 transitions, 676 flow. Second operand 6 states and 1095 transitions. [2021-12-17 23:21:37,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 240 transitions, 928 flow [2021-12-17 23:21:37,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 240 transitions, 907 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-17 23:21:37,972 INFO L242 Difference]: Finished difference. Result has 220 places, 221 transitions, 764 flow [2021-12-17 23:21:37,972 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2021-12-17 23:21:37,973 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 28 predicate places. [2021-12-17 23:21:37,973 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 764 flow [2021-12-17 23:21:37,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 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-17 23:21:37,973 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:37,973 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] [2021-12-17 23:21:37,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 23:21:37,974 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash 821003656, now seen corresponding path program 1 times [2021-12-17 23:21:37,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:37,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094911601] [2021-12-17 23:21:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:37,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:38,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:38,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094911601] [2021-12-17 23:21:38,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094911601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:38,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:38,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:21:38,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410856463] [2021-12-17 23:21:38,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:38,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:21:38,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:21:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:21:38,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 213 [2021-12-17 23:21:38,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 764 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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-17 23:21:38,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:38,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 213 [2021-12-17 23:21:38,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:38,192 INFO L129 PetriNetUnfolder]: 120/1433 cut-off events. [2021-12-17 23:21:38,192 INFO L130 PetriNetUnfolder]: For 997/1034 co-relation queries the response was YES. [2021-12-17 23:21:38,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 1433 events. 120/1433 cut-off events. For 997/1034 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8226 event pairs, 18 based on Foata normal form. 26/1348 useless extension candidates. Maximal degree in co-relation 2326. Up to 168 conditions per place. [2021-12-17 23:21:38,199 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 44 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2021-12-17 23:21:38,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 233 transitions, 948 flow [2021-12-17 23:21:38,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 23:21:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 23:21:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 762 transitions. [2021-12-17 23:21:38,201 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8943661971830986 [2021-12-17 23:21:38,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 762 transitions. [2021-12-17 23:21:38,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 762 transitions. [2021-12-17 23:21:38,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:38,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 762 transitions. [2021-12-17 23:21:38,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 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-17 23:21:38,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:38,204 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:38,204 INFO L186 Difference]: Start difference. First operand has 220 places, 221 transitions, 764 flow. Second operand 4 states and 762 transitions. [2021-12-17 23:21:38,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 233 transitions, 948 flow [2021-12-17 23:21:38,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 233 transitions, 924 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-17 23:21:38,209 INFO L242 Difference]: Finished difference. Result has 221 places, 225 transitions, 819 flow [2021-12-17 23:21:38,209 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=819, PETRI_PLACES=221, PETRI_TRANSITIONS=225} [2021-12-17 23:21:38,211 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 29 predicate places. [2021-12-17 23:21:38,211 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 225 transitions, 819 flow [2021-12-17 23:21:38,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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-17 23:21:38,212 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:38,212 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] [2021-12-17 23:21:38,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 23:21:38,213 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1158527802, now seen corresponding path program 2 times [2021-12-17 23:21:38,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:38,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432115598] [2021-12-17 23:21:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:38,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:38,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432115598] [2021-12-17 23:21:38,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432115598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:38,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:38,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 23:21:38,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849167494] [2021-12-17 23:21:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:38,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 23:21:38,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 23:21:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 23:21:38,288 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 213 [2021-12-17 23:21:38,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 225 transitions, 819 flow. Second operand has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 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-17 23:21:38,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:38,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 213 [2021-12-17 23:21:38,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:38,558 INFO L129 PetriNetUnfolder]: 305/2128 cut-off events. [2021-12-17 23:21:38,559 INFO L130 PetriNetUnfolder]: For 1870/1870 co-relation queries the response was YES. [2021-12-17 23:21:38,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 2128 events. 305/2128 cut-off events. For 1870/1870 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 13712 event pairs, 128 based on Foata normal form. 8/2001 useless extension candidates. Maximal degree in co-relation 3826. Up to 290 conditions per place. [2021-12-17 23:21:38,568 INFO L132 encePairwiseOnDemand]: 206/213 looper letters, 79 selfloop transitions, 16 changer transitions 3/260 dead transitions. [2021-12-17 23:21:38,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 260 transitions, 1157 flow [2021-12-17 23:21:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 23:21:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 23:21:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1099 transitions. [2021-12-17 23:21:38,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8599374021909233 [2021-12-17 23:21:38,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1099 transitions. [2021-12-17 23:21:38,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1099 transitions. [2021-12-17 23:21:38,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:38,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1099 transitions. [2021-12-17 23:21:38,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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-17 23:21:38,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:38,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 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-17 23:21:38,575 INFO L186 Difference]: Start difference. First operand has 221 places, 225 transitions, 819 flow. Second operand 6 states and 1099 transitions. [2021-12-17 23:21:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 260 transitions, 1157 flow [2021-12-17 23:21:38,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 260 transitions, 1149 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-12-17 23:21:38,580 INFO L242 Difference]: Finished difference. Result has 228 places, 227 transitions, 886 flow [2021-12-17 23:21:38,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2021-12-17 23:21:38,581 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 36 predicate places. [2021-12-17 23:21:38,581 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 886 flow [2021-12-17 23:21:38,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 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-17 23:21:38,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:38,582 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] [2021-12-17 23:21:38,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 23:21:38,582 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1884042800, now seen corresponding path program 3 times [2021-12-17 23:21:38,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:38,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556659919] [2021-12-17 23:21:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:38,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:38,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556659919] [2021-12-17 23:21:38,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556659919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 23:21:38,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 23:21:38,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 23:21:38,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665584201] [2021-12-17 23:21:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 23:21:38,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 23:21:38,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:38,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 23:21:38,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 23:21:38,627 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 213 [2021-12-17 23:21:38,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 886 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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-17 23:21:38,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:38,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 213 [2021-12-17 23:21:38,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:38,772 INFO L129 PetriNetUnfolder]: 110/1185 cut-off events. [2021-12-17 23:21:38,772 INFO L130 PetriNetUnfolder]: For 1259/1301 co-relation queries the response was YES. [2021-12-17 23:21:38,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1185 events. 110/1185 cut-off events. For 1259/1301 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6307 event pairs, 13 based on Foata normal form. 23/1119 useless extension candidates. Maximal degree in co-relation 2115. Up to 135 conditions per place. [2021-12-17 23:21:38,778 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 37 selfloop transitions, 20 changer transitions 2/237 dead transitions. [2021-12-17 23:21:38,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 237 transitions, 1063 flow [2021-12-17 23:21:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 23:21:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 23:21:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2021-12-17 23:21:38,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8955399061032864 [2021-12-17 23:21:38,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2021-12-17 23:21:38,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2021-12-17 23:21:38,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:21:38,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2021-12-17 23:21:38,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 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-17 23:21:38,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:38,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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-17 23:21:38,783 INFO L186 Difference]: Start difference. First operand has 228 places, 227 transitions, 886 flow. Second operand 4 states and 763 transitions. [2021-12-17 23:21:38,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 237 transitions, 1063 flow [2021-12-17 23:21:38,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 237 transitions, 1032 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-12-17 23:21:38,789 INFO L242 Difference]: Finished difference. Result has 228 places, 228 transitions, 917 flow [2021-12-17 23:21:38,789 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=917, PETRI_PLACES=228, PETRI_TRANSITIONS=228} [2021-12-17 23:21:38,789 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 36 predicate places. [2021-12-17 23:21:38,789 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 228 transitions, 917 flow [2021-12-17 23:21:38,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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-17 23:21:38,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:21:38,790 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] [2021-12-17 23:21:38,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 23:21:38,790 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:21:38,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:21:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -741987059, now seen corresponding path program 1 times [2021-12-17 23:21:38,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:21:38,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189777304] [2021-12-17 23:21:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:38,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:21:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:21:39,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:21:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189777304] [2021-12-17 23:21:39,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189777304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:21:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757275886] [2021-12-17 23:21:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:21:39,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:21:39,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:21:39,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:21:39,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 23:21:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:21:39,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-17 23:21:39,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:21:40,084 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-17 23:21:40,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2021-12-17 23:21:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:21:40,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:21:40,891 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-17 23:21:40,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2021-12-17 23:21:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:21:41,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757275886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:21:41,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:21:41,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 40 [2021-12-17 23:21:41,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226124372] [2021-12-17 23:21:41,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:21:41,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-17 23:21:41,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:21:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-17 23:21:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2021-12-17 23:21:41,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 213 [2021-12-17 23:21:41,682 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 228 transitions, 917 flow. Second operand has 40 states, 40 states have (on average 91.05) internal successors, (3642), 40 states have internal predecessors, (3642), 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-17 23:21:41,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:21:41,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 213 [2021-12-17 23:21:41,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:21:45,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 23:21:48,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:21:51,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:21:53,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:21:55,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:21:59,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:07,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:10,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:19,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:22,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:24,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:29,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:31,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:38,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:40,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:45,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:49,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:50,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:52,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:55,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:22:57,474 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:23:00,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:23:02,349 INFO L129 PetriNetUnfolder]: 20555/41229 cut-off events. [2021-12-17 23:23:02,350 INFO L130 PetriNetUnfolder]: For 49590/49592 co-relation queries the response was YES. [2021-12-17 23:23:02,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98915 conditions, 41229 events. 20555/41229 cut-off events. For 49590/49592 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 366799 event pairs, 891 based on Foata normal form. 346/39691 useless extension candidates. Maximal degree in co-relation 98891. Up to 6833 conditions per place. [2021-12-17 23:23:02,777 INFO L132 encePairwiseOnDemand]: 144/213 looper letters, 1283 selfloop transitions, 528 changer transitions 321/2206 dead transitions. [2021-12-17 23:23:02,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 2206 transitions, 11976 flow [2021-12-17 23:23:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2021-12-17 23:23:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2021-12-17 23:23:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 16824 transitions. [2021-12-17 23:23:02,800 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.44878361075544176 [2021-12-17 23:23:02,800 INFO L72 ComplementDD]: Start complementDD. Operand 176 states and 16824 transitions. [2021-12-17 23:23:02,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 16824 transitions. [2021-12-17 23:23:02,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:23:02,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 176 states and 16824 transitions. [2021-12-17 23:23:02,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 177 states, 176 states have (on average 95.5909090909091) internal successors, (16824), 176 states have internal predecessors, (16824), 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-17 23:23:02,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 177 states, 177 states have (on average 213.0) internal successors, (37701), 177 states have internal predecessors, (37701), 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-17 23:23:02,936 INFO L81 ComplementDD]: Finished complementDD. Result has 177 states, 177 states have (on average 213.0) internal successors, (37701), 177 states have internal predecessors, (37701), 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-17 23:23:02,951 INFO L186 Difference]: Start difference. First operand has 228 places, 228 transitions, 917 flow. Second operand 176 states and 16824 transitions. [2021-12-17 23:23:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 2206 transitions, 11976 flow [2021-12-17 23:23:03,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 2206 transitions, 11752 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-17 23:23:03,153 INFO L242 Difference]: Finished difference. Result has 524 places, 745 transitions, 5958 flow [2021-12-17 23:23:03,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=176, PETRI_FLOW=5958, PETRI_PLACES=524, PETRI_TRANSITIONS=745} [2021-12-17 23:23:03,155 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 332 predicate places. [2021-12-17 23:23:03,155 INFO L470 AbstractCegarLoop]: Abstraction has has 524 places, 745 transitions, 5958 flow [2021-12-17 23:23:03,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 91.05) internal successors, (3642), 40 states have internal predecessors, (3642), 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-17 23:23:03,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:23:03,156 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] [2021-12-17 23:23:03,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 23:23:03,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:23:03,372 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:23:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:23:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash 293581339, now seen corresponding path program 2 times [2021-12-17 23:23:03,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:23:03,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312953640] [2021-12-17 23:23:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:23:03,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:23:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:23:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:23:03,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:23:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312953640] [2021-12-17 23:23:03,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312953640] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:23:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228998060] [2021-12-17 23:23:03,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 23:23:03,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:23:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:23:03,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:23:03,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 23:23:03,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 23:23:03,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:23:03,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-17 23:23:03,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:23:03,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:23:03,816 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 23:23:03,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-17 23:23:04,138 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 23:23:04,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-17 23:23:04,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 23:23:04,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:23:04,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:23:05,096 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-12-17 23:23:05,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2021-12-17 23:23:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:23:05,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:23:06,764 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:23:06,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2021-12-17 23:23:06,773 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-17 23:23:06,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 173 [2021-12-17 23:23:06,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 23:23:06,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2021-12-17 23:23:06,786 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 23:23:06,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2021-12-17 23:23:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 23:23:09,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228998060] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:23:09,605 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:23:09,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 27] total 54 [2021-12-17 23:23:09,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460680426] [2021-12-17 23:23:09,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:23:09,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-17 23:23:09,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:23:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-17 23:23:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2498, Unknown=82, NotChecked=0, Total=2862 [2021-12-17 23:23:09,608 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 213 [2021-12-17 23:23:09,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 745 transitions, 5958 flow. Second operand has 54 states, 54 states have (on average 84.24074074074075) internal successors, (4549), 54 states have internal predecessors, (4549), 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-17 23:23:09,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:23:09,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 213 [2021-12-17 23:23:09,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:23:44,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 23:23:58,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~f~0.base) c_~f~0.offset)) (.cse0 (div c_~n~0 4294967296))) (and (<= (+ |c_thread1Thread1of1ForFork0_~i~0#1| (* 21474836480 .cse0)) (+ (* 5 c_~n~0) 1)) (<= c_~size~0 1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse1) (forall ((~x2~0 Int) (v_ArrVal_194 (Array Int Int))) (or (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) c_~f~0.base))) (= (select .cse2 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse2 (+ (* c_~x1~0 4) c_~f~0.offset)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (<= (+ (* 17179869185 (div (* c_~n~0 5) 4294967296)) (* 4 |c_thread1Thread1of1ForFork0_~i~0#1|) 1) (+ (* 20 c_~n~0) (* 5 .cse0) (* 17179869185 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< c_~x2~0 1) (<= 0 c_~x2~0) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= c_~x1~0 .cse1) (<= c_~n~0 (+ (* 4294967296 .cse0) 858993458)))) is different from false [2021-12-17 23:24:01,985 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] L63-1-->L63-2: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (<= 0 v_~x2~0_5) (< v_~x2~0_5 v_~size~0_3)) 1 0)) InVars {~size~0=v_~size~0_3, ~x2~0=v_~x2~0_5} OutVars{~x2~0=v_~x2~0_5, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~size~0=v_~size~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1][2005], [227#true, 42#L63-2true, Black: 2902#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3006#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3034#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3086#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2982#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3024#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2808#(and (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 2938#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2998#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2872#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3082#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3010#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2986#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2854#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3036#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3130#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3022#(and (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2908#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3068#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2964#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3042#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x2~0 ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2860#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2916#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3026#(and (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2924#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3056#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2976#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3088#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3122#(and (= ~x1~0 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2900#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2974#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3094#(and (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3098#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3118#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2884#(and (<= ~size~0 1) (< ~x2~0 1) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3044#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3046#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x2~0 ~x1~0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2990#(and (<= ~size~0 1) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2904#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2972#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2980#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3110#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3120#(and (= ~x1~0 0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3008#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2912#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3018#(and (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), 1672#(<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) 1) (* 5 ~n~0)), Black: 3104#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3000#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3078#(and (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2950#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3116#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3076#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3106#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1407#(forall ((~n~0 Int)) (or (<= (mod (* ~n~0 5) 4294967296) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod (* ~n~0 5) 4294967296)))), Black: 3054#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3020#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 955#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3100#(and (= ~x1~0 0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 956#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 2874#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3080#(and (= ~x1~0 0) (<= ~size~0 1) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2802#(and (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2804#(and (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 3084#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2898#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3074#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2896#(and (<= ~size~0 1) (< ~x2~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3066#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1662#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 1663#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 1) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))))), Black: 2846#(and (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2918#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1664#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) 1) (+ (* 5 ~n~0) (* 4294967296 (div |thread2Thread1of1ForFork1_~i~1#1| 4294967296)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 3030#(and (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1661#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 3032#(and (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2888#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3114#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x2~0 ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (= ~x1~0 0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2870#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2920#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1673#(and (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) 1) (* 5 ~n~0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0)), Black: 2880#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3012#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2994#(and (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3108#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3136#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2996#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3126#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3062#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2810#(and (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 2838#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2864#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3112#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2910#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2946#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1679#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3050#(and (= ~x2~0 ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (<= ~size~0 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2956#(and (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2970#(and (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2936#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2848#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3058#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x2~0 ~x1~0) (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2876#(and (<= ~size~0 1) (< ~x2~0 1) (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4294967296 (div (+ (* (div (* ~n~0 5) 4294967296) (- 1)) (* (div ~n~0 4294967296) 5)) 5)))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2830#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 1693#(= |thread1Thread1of1ForFork0_~i~0#1| 0), Black: 3124#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3102#(and (= ~x1~0 0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), 4451#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 21474836480 (div ~n~0 4294967296))) (+ (* 5 ~n~0) 1)) (<= (+ (* 17179869185 (div (* ~n~0 5) 4294967296)) (* 4 |thread1Thread1of1ForFork0_~i~0#1|) 1) (+ (* 20 ~n~0) (* 5 (div ~n~0 4294967296)) (* 17179869185 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3064#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3092#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2894#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4294967296 (div (+ (* (div (* ~n~0 5) 4294967296) (- 1)) (* (div ~n~0 4294967296) 5)) 5)))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3052#(and (= ~x2~0 ~x1~0) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (<= ~size~0 1) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3090#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2962#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2978#(and (<= ~size~0 1) (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4294967296 (div (+ (* (div (* ~n~0 5) 4294967296) (- 1)) (* (div ~n~0 4294967296) 5)) 5)))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3132#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (< ~x2~0 1) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3040#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2984#(and (<= ~size~0 1) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3048#(and (= ~x1~0 |thread2Thread1of1ForFork1_#t~mem11#1|) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 630#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (mod (* ~n~0 5) 4294967296)), Black: 3070#(and (= ~x2~0 ~x1~0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 243#true, Black: 3128#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2952#(and (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2840#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2836#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2942#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3060#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x2~0 ~x1~0) (<= ~size~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and (< ~x2~0 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (<= 0 ~x2~0))) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2922#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3072#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (<= ~size~0 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 3002#(and (= |thread2Thread1of1ForFork1_#t~post4#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 946#(= |thread2Thread1of1ForFork1_~i~1#1| 0), Black: 2954#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), 206#true, Black: 3134#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (<= ~size~0 1) (< ~x2~0 1) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 0 ~x2~0) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2878#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4294967296 (div (+ (* (div (* ~n~0 5) 4294967296) (- 1)) (* (div ~n~0 4294967296) 5)) 5)))) (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2850#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= ~x1~0 0) (= ~x2~0 ~x1~0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~size~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= 0 |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|) (= ~x1~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)))) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2862#(and (<= (+ (* 4611686018427387904 (div (* ~n~0 5) 4294967296)) (* 1073741824 |thread1Thread1of1ForFork0_~i~0#1|) (* 4294967296 (div ~n~0 4294967296)) 1073741824) (+ (* 5368709121 ~n~0) (* 4611686018427387904 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), Black: 2886#(and (= |thread1Thread1of1ForFork0_#t~post2#1| 0) (<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) |thread1Thread1of1ForFork0_~i~0#1| 4) (+ (* 5 ~n~0) (* 4294967296 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), 3096#(and (= ~x1~0 0) (<= ~size~0 1) (or (and (< ~x2~0 1) (<= 0 ~x2~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x1~0 (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (<= ~n~0 (+ (* 4294967296 (div ~n~0 4294967296)) 858993458))), 247#(<= (+ (* 4294967296 (div (* ~n~0 5) 4294967296)) 1) (* 5 ~n~0)), 22#L52true, Black: 224#(and (<= 1 ~size~0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 234#(and (= ~x2~0 ~x1~0) (= 0 ~x1~0)), 953#true, 93#L93-1true]) [2021-12-17 23:24:01,987 INFO L384 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2021-12-17 23:24:01,987 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-12-17 23:24:01,987 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-12-17 23:24:01,988 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-12-17 23:24:07,272 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~x2~0 1)) (.cse4 (<= 0 c_~x2~0)) (.cse1 (select (select |c_#memory_int| c_~f~0.base) c_~f~0.offset)) (.cse0 (div c_~n~0 4294967296))) (and (<= (+ |c_thread1Thread1of1ForFork0_~i~0#1| (* 21474836480 .cse0)) (+ (* 5 c_~n~0) 1)) (<= c_~size~0 1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse1) (forall ((~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse2 (select |c_#memory_int| c_~f~0.base))) (= (select .cse2 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse2 (+ (* c_~x1~0 4) c_~f~0.offset)))))) (or (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and .cse3 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) .cse4)) .cse3 (forall ((~x2~0 Int) (v_ArrVal_194 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) c_~f~0.base))) (= (select .cse5 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse5 (+ (* c_~x1~0 4) c_~f~0.offset)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (<= (+ (* 17179869185 (div (* c_~n~0 5) 4294967296)) (* 4 |c_thread1Thread1of1ForFork0_~i~0#1|) 1) (+ (* 20 c_~n~0) (* 5 .cse0) (* 17179869185 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and .cse3 .cse4 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) .cse4 (= c_~x1~0 .cse1) (<= c_~n~0 (+ (* 4294967296 .cse0) 858993458)))) is different from false [2021-12-17 23:24:33,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~x2~0 1)) (.cse2 (<= 0 c_~x2~0)) (.cse0 (div c_~n~0 4294967296))) (and (<= (+ |c_thread1Thread1of1ForFork0_~i~0#1| (* 21474836480 .cse0)) (+ (* 5 c_~n~0) 1)) (= |c_thread2Thread1of1ForFork1_#t~mem11#1| c_~x1~0) (<= c_~size~0 1) (or (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and .cse1 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) .cse2)) .cse1 (forall ((~x2~0 Int)) (or (= (select (select |c_#memory_int| c_~f~0.base) (+ (* ~x2~0 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (forall ((~x2~0 Int) (v_ArrVal_194 (Array Int Int))) (or (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) c_~f~0.base))) (= (select .cse3 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse3 (+ (* c_~x1~0 4) c_~f~0.offset)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (<= (+ (* 17179869185 (div (* c_~n~0 5) 4294967296)) (* 4 |c_thread1Thread1of1ForFork0_~i~0#1|) 1) (+ (* 20 c_~n~0) (* 5 .cse0) (* 17179869185 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (or (and .cse1 .cse2 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) .cse2 (= c_~x1~0 (select (select |c_#memory_int| c_~f~0.base) c_~f~0.offset)) (<= c_~n~0 (+ (* 4294967296 .cse0) 858993458)))) is different from false [2021-12-17 23:24:37,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~x2~0 1)) (.cse4 (<= 0 c_~x2~0)) (.cse0 (div c_~n~0 4294967296)) (.cse1 (select (select |c_#memory_int| c_~f~0.base) c_~f~0.offset))) (and (<= (+ |c_thread1Thread1of1ForFork0_~i~0#1| (* 21474836480 .cse0)) (+ (* 5 c_~n~0) 1)) (<= c_~size~0 1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse1) (forall ((~x2~0 Int)) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse2 (select |c_#memory_int| c_~f~0.base))) (= (select .cse2 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse2 (+ (* c_~x1~0 4) c_~f~0.offset)))))) (or (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (and .cse3 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) .cse4)) .cse3 (or (and .cse3 .cse4 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1)) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) .cse4 (<= c_~n~0 (+ (* 4294967296 .cse0) 858993458)) (= |c_thread2Thread1of1ForFork1_#t~mem11#1| c_~x1~0) (forall ((~x2~0 Int) (v_ArrVal_194 (Array Int Int))) (or (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) c_~f~0.base))) (= (select .cse5 (+ (* ~x2~0 4) c_~f~0.offset)) (select .cse5 (+ (* c_~x1~0 4) c_~f~0.offset)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) (<= (+ (* 17179869185 (div (* c_~n~0 5) 4294967296)) (* 4 |c_thread1Thread1of1ForFork0_~i~0#1|) 1) (+ (* 20 c_~n~0) (* 5 .cse0) (* 17179869185 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)))) (= c_~x1~0 .cse1))) is different from false [2021-12-17 23:24:54,818 INFO L129 PetriNetUnfolder]: 42474/95862 cut-off events. [2021-12-17 23:24:54,819 INFO L130 PetriNetUnfolder]: For 3476906/3479320 co-relation queries the response was YES. [2021-12-17 23:24:57,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679067 conditions, 95862 events. 42474/95862 cut-off events. For 3476906/3479320 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 989680 event pairs, 3961 based on Foata normal form. 1597/96192 useless extension candidates. Maximal degree in co-relation 678919. Up to 21679 conditions per place. [2021-12-17 23:24:58,576 INFO L132 encePairwiseOnDemand]: 142/213 looper letters, 2647 selfloop transitions, 3118 changer transitions 152/6038 dead transitions. [2021-12-17 23:24:58,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 6038 transitions, 79859 flow [2021-12-17 23:24:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2021-12-17 23:24:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2021-12-17 23:24:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 25686 transitions. [2021-12-17 23:24:58,611 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4201796142709918 [2021-12-17 23:24:58,611 INFO L72 ComplementDD]: Start complementDD. Operand 287 states and 25686 transitions. [2021-12-17 23:24:58,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 25686 transitions. [2021-12-17 23:24:58,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 23:24:58,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 287 states and 25686 transitions. [2021-12-17 23:24:58,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 288 states, 287 states have (on average 89.49825783972125) internal successors, (25686), 287 states have internal predecessors, (25686), 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-17 23:24:58,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 288 states, 288 states have (on average 213.0) internal successors, (61344), 288 states have internal predecessors, (61344), 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-17 23:24:58,733 INFO L81 ComplementDD]: Finished complementDD. Result has 288 states, 288 states have (on average 213.0) internal successors, (61344), 288 states have internal predecessors, (61344), 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-17 23:24:58,733 INFO L186 Difference]: Start difference. First operand has 524 places, 745 transitions, 5958 flow. Second operand 287 states and 25686 transitions. [2021-12-17 23:24:58,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 769 places, 6038 transitions, 79859 flow [2021-12-17 23:25:12,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 6038 transitions, 74465 flow, removed 2502 selfloop flow, removed 31 redundant places. [2021-12-17 23:25:12,318 INFO L242 Difference]: Finished difference. Result has 942 places, 4247 transitions, 52980 flow [2021-12-17 23:25:12,319 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=5232, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=287, PETRI_FLOW=52980, PETRI_PLACES=942, PETRI_TRANSITIONS=4247} [2021-12-17 23:25:12,319 INFO L334 CegarLoopForPetriNet]: 192 programPoint places, 750 predicate places. [2021-12-17 23:25:12,320 INFO L470 AbstractCegarLoop]: Abstraction has has 942 places, 4247 transitions, 52980 flow [2021-12-17 23:25:12,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 84.24074074074075) internal successors, (4549), 54 states have internal predecessors, (4549), 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-17 23:25:12,321 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 23:25:12,321 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 23:25:12,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 23:25:12,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:25:12,539 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 23:25:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 23:25:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash -485061040, now seen corresponding path program 3 times [2021-12-17 23:25:12,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 23:25:12,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566944331] [2021-12-17 23:25:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 23:25:12,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 23:25:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 23:25:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 23:25:13,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 23:25:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566944331] [2021-12-17 23:25:13,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566944331] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 23:25:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089880190] [2021-12-17 23:25:13,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 23:25:13,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 23:25:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 23:25:13,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 23:25:13,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 23:25:13,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 23:25:13,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 23:25:13,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 23:25:13,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 23:25:14,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 23:25:14,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:25:14,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 23:25:15,467 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-12-17 23:25:15,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2021-12-17 23:25:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 23:25:15,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 23:25:19,479 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 23:25:19,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2021-12-17 23:25:19,494 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-12-17 23:25:19,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 173 [2021-12-17 23:25:19,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 23:25:19,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2021-12-17 23:25:19,511 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-17 23:25:19,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2021-12-17 23:25:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 23:25:19,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089880190] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 23:25:19,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 23:25:19,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 26] total 70 [2021-12-17 23:25:19,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163189977] [2021-12-17 23:25:19,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 23:25:19,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-12-17 23:25:19,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 23:25:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-12-17 23:25:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=4376, Unknown=112, NotChecked=0, Total=4830 [2021-12-17 23:25:19,853 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 213 [2021-12-17 23:25:19,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 4247 transitions, 52980 flow. Second operand has 70 states, 70 states have (on average 67.1) internal successors, (4697), 70 states have internal predecessors, (4697), 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-17 23:25:19,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 23:25:19,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 213 [2021-12-17 23:25:19,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 23:25:32,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []