/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 02:06:07,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 02:06:07,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 02:06:08,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 02:06:08,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 02:06:08,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 02:06:08,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 02:06:08,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 02:06:08,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 02:06:08,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 02:06:08,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 02:06:08,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 02:06:08,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 02:06:08,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 02:06:08,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 02:06:08,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 02:06:08,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 02:06:08,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 02:06:08,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 02:06:08,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 02:06:08,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 02:06:08,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 02:06:08,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 02:06:08,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 02:06:08,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 02:06:08,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 02:06:08,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 02:06:08,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 02:06:08,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 02:06:08,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 02:06:08,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 02:06:08,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 02:06:08,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 02:06:08,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 02:06:08,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 02:06:08,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 02:06:08,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 02:06:08,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 02:06:08,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 02:06:08,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 02:06:08,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 02:06:08,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 02:06:08,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 02:06:08,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 02:06:08,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 02:06:08,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 02:06:08,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 02:06:08,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 02:06:08,069 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 02:06:08,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 02:06:08,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 02:06:08,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 02:06:08,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 02:06:08,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 02:06:08,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:06:08,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 02:06:08,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 02:06:08,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 02:06:08,073 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 [2022-01-19 02:06:08,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 02:06:08,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 02:06:08,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 02:06:08,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 02:06:08,275 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 02:06:08,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-01-19 02:06:08,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46545c2/f86065ff781548fa980faf78327f73c0/FLAG5285a546a [2022-01-19 02:06:08,652 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 02:06:08,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-01-19 02:06:08,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46545c2/f86065ff781548fa980faf78327f73c0/FLAG5285a546a [2022-01-19 02:06:08,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc46545c2/f86065ff781548fa980faf78327f73c0 [2022-01-19 02:06:08,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 02:06:08,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 02:06:08,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 02:06:08,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 02:06:08,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 02:06:08,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242027e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08, skipping insertion in model container [2022-01-19 02:06:08,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 02:06:08,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 02:06:08,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-01-19 02:06:08,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:06:08,824 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 02:06:08,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-01-19 02:06:08,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:06:08,851 INFO L208 MainTranslator]: Completed translation [2022-01-19 02:06:08,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08 WrapperNode [2022-01-19 02:06:08,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 02:06:08,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 02:06:08,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 02:06:08,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 02:06:08,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,874 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-01-19 02:06:08,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 02:06:08,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 02:06:08,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 02:06:08,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 02:06:08,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 02:06:08,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 02:06:08,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 02:06:08,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 02:06:08,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (1/1) ... [2022-01-19 02:06:08,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:06:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:06:08,928 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) [2022-01-19 02:06:08,951 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 [2022-01-19 02:06:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 02:06:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 02:06:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 02:06:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 02:06:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 02:06:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 02:06:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 02:06:08,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 02:06:08,962 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 02:06:09,078 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 02:06:09,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 02:06:09,253 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 02:06:09,298 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 02:06:09,298 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 02:06:09,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:06:09 BoogieIcfgContainer [2022-01-19 02:06:09,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 02:06:09,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 02:06:09,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 02:06:09,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 02:06:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:06:08" (1/3) ... [2022-01-19 02:06:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af49b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:06:09, skipping insertion in model container [2022-01-19 02:06:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:06:08" (2/3) ... [2022-01-19 02:06:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af49b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:06:09, skipping insertion in model container [2022-01-19 02:06:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:06:09" (3/3) ... [2022-01-19 02:06:09,309 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-01-19 02:06:09,312 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 02:06:09,312 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 02:06:09,313 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 02:06:09,369 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,371 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,372 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,373 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,373 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,375 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,375 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,376 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,378 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,379 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,380 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,381 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,382 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,382 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,383 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,384 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,384 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,386 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,388 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,389 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:06:09,402 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 02:06:09,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 02:06:09,439 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=false, 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 [2022-01-19 02:06:09,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 02:06:09,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-01-19 02:06:09,489 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2022-01-19 02:06:09,489 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 02:06:09,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-01-19 02:06:09,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-01-19 02:06:09,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-01-19 02:06:09,532 INFO L129 PetriNetUnfolder]: 13/144 cut-off events. [2022-01-19 02:06:09,532 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 02:06:09,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:09,533 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] [2022-01-19 02:06:09,534 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:09,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -363023648, now seen corresponding path program 1 times [2022-01-19 02:06:09,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:09,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212810348] [2022-01-19 02:06:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:09,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:09,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:09,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212810348] [2022-01-19 02:06:09,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212810348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:06:09,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:06:09,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 02:06:09,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722672334] [2022-01-19 02:06:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:06:09,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 02:06:09,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 02:06:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 02:06:09,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-01-19 02:06:09,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:09,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:09,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-01-19 02:06:09,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:09,884 INFO L129 PetriNetUnfolder]: 42/270 cut-off events. [2022-01-19 02:06:09,884 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-01-19 02:06:09,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 719 event pairs, 15 based on Foata normal form. 42/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-01-19 02:06:09,889 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-01-19 02:06:09,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-01-19 02:06:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 02:06:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 02:06:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-01-19 02:06:09,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-01-19 02:06:09,909 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-01-19 02:06:09,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-01-19 02:06:09,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:09,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-01-19 02:06:09,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:09,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:09,922 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:09,923 INFO L186 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-01-19 02:06:09,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-01-19 02:06:09,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 02:06:09,929 INFO L242 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-01-19 02:06:09,930 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-01-19 02:06:09,934 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-01-19 02:06:09,934 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-01-19 02:06:09,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:09,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:09,935 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] [2022-01-19 02:06:09,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 02:06:09,935 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 811959335, now seen corresponding path program 1 times [2022-01-19 02:06:09,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:09,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412113942] [2022-01-19 02:06:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:09,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:10,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:10,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412113942] [2022-01-19 02:06:10,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412113942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:06:10,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:06:10,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 02:06:10,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054597037] [2022-01-19 02:06:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:06:10,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 02:06:10,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 02:06:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 02:06:10,191 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-01-19 02:06:10,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:10,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-01-19 02:06:10,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:10,362 INFO L129 PetriNetUnfolder]: 396/824 cut-off events. [2022-01-19 02:06:10,362 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-01-19 02:06:10,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 824 events. 396/824 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3520 event pairs, 109 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 1426. Up to 305 conditions per place. [2022-01-19 02:06:10,367 INFO L132 encePairwiseOnDemand]: 152/159 looper letters, 42 selfloop transitions, 6 changer transitions 0/142 dead transitions. [2022-01-19 02:06:10,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 142 transitions, 388 flow [2022-01-19 02:06:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 02:06:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 02:06:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 691 transitions. [2022-01-19 02:06:10,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7243186582809225 [2022-01-19 02:06:10,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 691 transitions. [2022-01-19 02:06:10,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 691 transitions. [2022-01-19 02:06:10,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:10,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 691 transitions. [2022-01-19 02:06:10,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,376 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,376 INFO L186 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 6 states and 691 transitions. [2022-01-19 02:06:10,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 142 transitions, 388 flow [2022-01-19 02:06:10,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 142 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 02:06:10,381 INFO L242 Difference]: Finished difference. Result has 140 places, 134 transitions, 297 flow [2022-01-19 02:06:10,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=134} [2022-01-19 02:06:10,383 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -2 predicate places. [2022-01-19 02:06:10,383 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 134 transitions, 297 flow [2022-01-19 02:06:10,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:10,386 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] [2022-01-19 02:06:10,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 02:06:10,390 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -533935902, now seen corresponding path program 1 times [2022-01-19 02:06:10,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:10,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381439797] [2022-01-19 02:06:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:10,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:10,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381439797] [2022-01-19 02:06:10,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381439797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:06:10,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:06:10,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 02:06:10,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308368886] [2022-01-19 02:06:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:06:10,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 02:06:10,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 02:06:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-19 02:06:10,597 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 159 [2022-01-19 02:06:10,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 134 transitions, 297 flow. Second operand has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:10,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 159 [2022-01-19 02:06:10,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:10,818 INFO L129 PetriNetUnfolder]: 396/805 cut-off events. [2022-01-19 02:06:10,818 INFO L130 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-01-19 02:06:10,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 805 events. 396/805 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3353 event pairs, 199 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 1597. Up to 508 conditions per place. [2022-01-19 02:06:10,823 INFO L132 encePairwiseOnDemand]: 148/159 looper letters, 54 selfloop transitions, 7 changer transitions 4/150 dead transitions. [2022-01-19 02:06:10,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 150 transitions, 465 flow [2022-01-19 02:06:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 02:06:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 02:06:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 947 transitions. [2022-01-19 02:06:10,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6617749825296995 [2022-01-19 02:06:10,826 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 947 transitions. [2022-01-19 02:06:10,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 947 transitions. [2022-01-19 02:06:10,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:10,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 947 transitions. [2022-01-19 02:06:10,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 159.0) internal successors, (1590), 10 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,831 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 159.0) internal successors, (1590), 10 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,831 INFO L186 Difference]: Start difference. First operand has 140 places, 134 transitions, 297 flow. Second operand 9 states and 947 transitions. [2022-01-19 02:06:10,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 150 transitions, 465 flow [2022-01-19 02:06:10,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 150 transitions, 453 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 02:06:10,837 INFO L242 Difference]: Finished difference. Result has 148 places, 135 transitions, 319 flow [2022-01-19 02:06:10,837 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2022-01-19 02:06:10,838 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2022-01-19 02:06:10,838 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 319 flow [2022-01-19 02:06:10,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:10,839 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:10,839 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] [2022-01-19 02:06:10,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 02:06:10,840 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1305271965, now seen corresponding path program 1 times [2022-01-19 02:06:10,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:10,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472788254] [2022-01-19 02:06:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:10,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 02:06:10,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472788254] [2022-01-19 02:06:10,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472788254] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:06:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215592828] [2022-01-19 02:06:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:10,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:06:10,967 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) [2022-01-19 02:06:10,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 02:06:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 02:06:11,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:06:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 02:06:11,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:06:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 02:06:11,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215592828] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:06:11,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:06:11,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 02:06:11,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913572294] [2022-01-19 02:06:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:06:11,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 02:06:11,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 02:06:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 02:06:11,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-01-19 02:06:11,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:11,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:11,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-01-19 02:06:11,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:11,574 INFO L129 PetriNetUnfolder]: 171/592 cut-off events. [2022-01-19 02:06:11,574 INFO L130 PetriNetUnfolder]: For 145/167 co-relation queries the response was YES. [2022-01-19 02:06:11,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 592 events. 171/592 cut-off events. For 145/167 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2821 event pairs, 80 based on Foata normal form. 22/563 useless extension candidates. Maximal degree in co-relation 1011. Up to 135 conditions per place. [2022-01-19 02:06:11,578 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 35 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2022-01-19 02:06:11,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 432 flow [2022-01-19 02:06:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 02:06:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 02:06:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-01-19 02:06:11,580 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-01-19 02:06:11,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-01-19 02:06:11,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-01-19 02:06:11,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:11,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-01-19 02:06:11,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:11,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:11,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:11,583 INFO L186 Difference]: Start difference. First operand has 148 places, 135 transitions, 319 flow. Second operand 7 states and 873 transitions. [2022-01-19 02:06:11,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 432 flow [2022-01-19 02:06:11,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 412 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 02:06:11,587 INFO L242 Difference]: Finished difference. Result has 148 places, 137 transitions, 333 flow [2022-01-19 02:06:11,587 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2022-01-19 02:06:11,587 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2022-01-19 02:06:11,588 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 333 flow [2022-01-19 02:06:11,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:11,588 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:11,588 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] [2022-01-19 02:06:11,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 02:06:11,805 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 [2022-01-19 02:06:11,805 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1256240202, now seen corresponding path program 1 times [2022-01-19 02:06:11,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:11,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002174114] [2022-01-19 02:06:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:11,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:12,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:12,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002174114] [2022-01-19 02:06:12,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002174114] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:06:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280429625] [2022-01-19 02:06:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:12,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:12,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:06:12,551 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) [2022-01-19 02:06:12,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 02:06:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:12,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-19 02:06:12,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:06:14,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:06:14,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 02:06:14,654 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:14,654 INFO L387 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 63 treesize of output 43 [2022-01-19 02:06:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:15,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:06:16,433 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:16,434 INFO L387 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 143 treesize of output 111 [2022-01-19 02:06:16,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2022-01-19 02:06:16,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2022-01-19 02:06:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:18,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280429625] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:06:18,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:06:18,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 79 [2022-01-19 02:06:18,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340968351] [2022-01-19 02:06:18,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:06:18,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-01-19 02:06:18,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:18,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-01-19 02:06:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1064, Invalid=5094, Unknown=4, NotChecked=0, Total=6162 [2022-01-19 02:06:18,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2022-01-19 02:06:18,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 333 flow. Second operand has 79 states, 79 states have (on average 56.69620253164557) internal successors, (4479), 79 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:18,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:18,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2022-01-19 02:06:18,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:27,697 INFO L129 PetriNetUnfolder]: 8709/14410 cut-off events. [2022-01-19 02:06:27,698 INFO L130 PetriNetUnfolder]: For 6438/6438 co-relation queries the response was YES. [2022-01-19 02:06:27,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33253 conditions, 14410 events. 8709/14410 cut-off events. For 6438/6438 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 107370 event pairs, 1512 based on Foata normal form. 3/13478 useless extension candidates. Maximal degree in co-relation 33243. Up to 3532 conditions per place. [2022-01-19 02:06:27,780 INFO L132 encePairwiseOnDemand]: 117/159 looper letters, 613 selfloop transitions, 226 changer transitions 18/902 dead transitions. [2022-01-19 02:06:27,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 902 transitions, 4268 flow [2022-01-19 02:06:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-01-19 02:06:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-01-19 02:06:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 6095 transitions. [2022-01-19 02:06:27,793 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3951890034364261 [2022-01-19 02:06:27,793 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 6095 transitions. [2022-01-19 02:06:27,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 6095 transitions. [2022-01-19 02:06:27,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:27,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 6095 transitions. [2022-01-19 02:06:27,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 62.83505154639175) internal successors, (6095), 97 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:27,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 159.0) internal successors, (15582), 98 states have internal predecessors, (15582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:27,823 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 159.0) internal successors, (15582), 98 states have internal predecessors, (15582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:27,823 INFO L186 Difference]: Start difference. First operand has 148 places, 137 transitions, 333 flow. Second operand 97 states and 6095 transitions. [2022-01-19 02:06:27,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 902 transitions, 4268 flow [2022-01-19 02:06:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 902 transitions, 4184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 02:06:27,851 INFO L242 Difference]: Finished difference. Result has 296 places, 371 transitions, 1893 flow [2022-01-19 02:06:27,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=1893, PETRI_PLACES=296, PETRI_TRANSITIONS=371} [2022-01-19 02:06:27,853 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 154 predicate places. [2022-01-19 02:06:27,853 INFO L470 AbstractCegarLoop]: Abstraction has has 296 places, 371 transitions, 1893 flow [2022-01-19 02:06:27,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 56.69620253164557) internal successors, (4479), 79 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:27,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:27,855 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] [2022-01-19 02:06:27,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 02:06:28,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:28,070 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:28,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash 361921754, now seen corresponding path program 2 times [2022-01-19 02:06:28,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:28,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359058069] [2022-01-19 02:06:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:28,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:28,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359058069] [2022-01-19 02:06:28,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359058069] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:06:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800717927] [2022-01-19 02:06:28,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:06:28,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:06:28,847 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) [2022-01-19 02:06:28,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 02:06:28,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:06:28,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:06:28,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-19 02:06:28,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:06:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:06:29,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 02:06:30,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:06:30,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 02:06:30,563 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:30,563 INFO L387 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 63 treesize of output 43 [2022-01-19 02:06:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 02:06:31,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:06:32,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:32,204 INFO L387 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 259 treesize of output 227 [2022-01-19 02:06:32,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 176 [2022-01-19 02:06:32,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 152 [2022-01-19 02:06:32,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2022-01-19 02:06:32,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 134 [2022-01-19 02:06:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 02:06:33,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800717927] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:06:33,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:06:33,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 27] total 71 [2022-01-19 02:06:33,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473017350] [2022-01-19 02:06:33,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:06:33,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-19 02:06:33,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-19 02:06:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=849, Invalid=4115, Unknown=6, NotChecked=0, Total=4970 [2022-01-19 02:06:33,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2022-01-19 02:06:33,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 371 transitions, 1893 flow. Second operand has 71 states, 71 states have (on average 56.95774647887324) internal successors, (4044), 71 states have internal predecessors, (4044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:33,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:33,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2022-01-19 02:06:33,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:06:44,483 INFO L129 PetriNetUnfolder]: 14970/25497 cut-off events. [2022-01-19 02:06:44,484 INFO L130 PetriNetUnfolder]: For 173105/173113 co-relation queries the response was YES. [2022-01-19 02:06:44,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99794 conditions, 25497 events. 14970/25497 cut-off events. For 173105/173113 co-relation queries the response was YES. Maximal size of possible extension queue 1445. Compared 215205 event pairs, 1658 based on Foata normal form. 9/25216 useless extension candidates. Maximal degree in co-relation 99728. Up to 6673 conditions per place. [2022-01-19 02:06:44,764 INFO L132 encePairwiseOnDemand]: 117/159 looper letters, 678 selfloop transitions, 659 changer transitions 23/1407 dead transitions. [2022-01-19 02:06:44,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1407 transitions, 11128 flow [2022-01-19 02:06:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-01-19 02:06:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-01-19 02:06:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 6142 transitions. [2022-01-19 02:06:44,772 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3901912203798996 [2022-01-19 02:06:44,772 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 6142 transitions. [2022-01-19 02:06:44,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 6142 transitions. [2022-01-19 02:06:44,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:06:44,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 6142 transitions. [2022-01-19 02:06:44,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 62.04040404040404) internal successors, (6142), 99 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:44,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 159.0) internal successors, (15900), 100 states have internal predecessors, (15900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:44,811 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 159.0) internal successors, (15900), 100 states have internal predecessors, (15900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:44,812 INFO L186 Difference]: Start difference. First operand has 296 places, 371 transitions, 1893 flow. Second operand 99 states and 6142 transitions. [2022-01-19 02:06:44,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1407 transitions, 11128 flow [2022-01-19 02:06:45,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1407 transitions, 10970 flow, removed 64 selfloop flow, removed 25 redundant places. [2022-01-19 02:06:45,498 INFO L242 Difference]: Finished difference. Result has 405 places, 906 transitions, 7551 flow [2022-01-19 02:06:45,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=7551, PETRI_PLACES=405, PETRI_TRANSITIONS=906} [2022-01-19 02:06:45,500 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 263 predicate places. [2022-01-19 02:06:45,500 INFO L470 AbstractCegarLoop]: Abstraction has has 405 places, 906 transitions, 7551 flow [2022-01-19 02:06:45,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 56.95774647887324) internal successors, (4044), 71 states have internal predecessors, (4044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:45,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:06:45,502 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] [2022-01-19 02:06:45,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 02:06:45,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:45,719 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:06:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:06:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 125995428, now seen corresponding path program 1 times [2022-01-19 02:06:45,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:06:45,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810483545] [2022-01-19 02:06:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:45,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:06:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:46,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:06:46,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810483545] [2022-01-19 02:06:46,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810483545] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:06:46,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509119661] [2022-01-19 02:06:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:06:46,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:06:46,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:06:46,515 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) [2022-01-19 02:06:46,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 02:06:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:06:46,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-19 02:06:46,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:06:48,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:06:48,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-01-19 02:06:48,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 02:06:48,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-01-19 02:06:48,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 02:06:48,523 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:48,523 INFO L387 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 55 treesize of output 32 [2022-01-19 02:06:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:48,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:06:49,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< c_~max3~0 .cse0)) (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0)))) (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_175 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))))) is different from false [2022-01-19 02:06:49,217 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0)) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_175) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse0) (not (< c_~max3~0 .cse0)) (not (< c_~max2~0 .cse0)))))) is different from false [2022-01-19 02:06:49,248 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:06:49,249 INFO L387 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 413 treesize of output 365 [2022-01-19 02:06:49,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 308 [2022-01-19 02:06:49,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 272 [2022-01-19 02:06:49,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 248 [2022-01-19 02:06:49,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 236 [2022-01-19 02:06:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:06:51,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509119661] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:06:51,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:06:51,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 85 [2022-01-19 02:06:51,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119433332] [2022-01-19 02:06:51,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:06:51,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-19 02:06:51,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:06:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-19 02:06:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=5991, Unknown=2, NotChecked=326, Total=7140 [2022-01-19 02:06:51,958 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 159 [2022-01-19 02:06:51,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 906 transitions, 7551 flow. Second operand has 85 states, 85 states have (on average 62.54117647058823) internal successors, (5316), 85 states have internal predecessors, (5316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:06:51,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:06:51,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 159 [2022-01-19 02:06:51,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:07:06,084 INFO L129 PetriNetUnfolder]: 22743/39072 cut-off events. [2022-01-19 02:07:06,084 INFO L130 PetriNetUnfolder]: For 604404/605851 co-relation queries the response was YES. [2022-01-19 02:07:06,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196660 conditions, 39072 events. 22743/39072 cut-off events. For 604404/605851 co-relation queries the response was YES. Maximal size of possible extension queue 2355. Compared 360118 event pairs, 3108 based on Foata normal form. 372/38865 useless extension candidates. Maximal degree in co-relation 196559. Up to 10134 conditions per place. [2022-01-19 02:07:06,849 INFO L132 encePairwiseOnDemand]: 112/159 looper letters, 1046 selfloop transitions, 774 changer transitions 21/1927 dead transitions. [2022-01-19 02:07:06,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1927 transitions, 20017 flow [2022-01-19 02:07:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-01-19 02:07:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-01-19 02:07:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 5844 transitions. [2022-01-19 02:07:06,856 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.43240843507214205 [2022-01-19 02:07:06,857 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 5844 transitions. [2022-01-19 02:07:06,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 5844 transitions. [2022-01-19 02:07:06,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:07:06,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 5844 transitions. [2022-01-19 02:07:06,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 68.75294117647059) internal successors, (5844), 85 states have internal predecessors, (5844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:07:06,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 159.0) internal successors, (13674), 86 states have internal predecessors, (13674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:07:06,976 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 159.0) internal successors, (13674), 86 states have internal predecessors, (13674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:07:06,976 INFO L186 Difference]: Start difference. First operand has 405 places, 906 transitions, 7551 flow. Second operand 85 states and 5844 transitions. [2022-01-19 02:07:06,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 1927 transitions, 20017 flow [2022-01-19 02:07:11,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 1927 transitions, 19440 flow, removed 265 selfloop flow, removed 25 redundant places. [2022-01-19 02:07:11,535 INFO L242 Difference]: Finished difference. Result has 498 places, 1294 transitions, 13703 flow [2022-01-19 02:07:11,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=7282, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=13703, PETRI_PLACES=498, PETRI_TRANSITIONS=1294} [2022-01-19 02:07:11,536 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 356 predicate places. [2022-01-19 02:07:11,536 INFO L470 AbstractCegarLoop]: Abstraction has has 498 places, 1294 transitions, 13703 flow [2022-01-19 02:07:11,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 62.54117647058823) internal successors, (5316), 85 states have internal predecessors, (5316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 02:07:11,537 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:07:11,538 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 02:07:11,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 02:07:11,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:07:11,751 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 02:07:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:07:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 301197568, now seen corresponding path program 3 times [2022-01-19 02:07:11,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:07:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529031883] [2022-01-19 02:07:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:07:11,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:07:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:07:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:07:12,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:07:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529031883] [2022-01-19 02:07:12,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529031883] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:07:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901247156] [2022-01-19 02:07:12,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 02:07:12,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:07:12,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:07:12,765 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) [2022-01-19 02:07:12,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 02:07:12,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 02:07:12,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:07:12,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 02:07:12,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:07:12,918 INFO L387 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 [2022-01-19 02:07:12,955 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 02:07:12,955 INFO L387 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 14 [2022-01-19 02:07:13,259 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-19 02:07:13,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 02:07:13,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 02:07:13,814 INFO L387 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 [2022-01-19 02:07:14,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 02:07:14,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 02:07:14,878 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:07:14,878 INFO L387 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 63 treesize of output 43 [2022-01-19 02:07:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 02:07:15,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:07:18,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (and (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= c_~max2~0 .cse2)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (<= 1 ~M~0))) is different from false [2022-01-19 02:07:28,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (and (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< c_~max3~0 .cse0))))) (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (< c_~max2~0 c_~max3~0))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (not .cse1) (= .cse2 c_~max2~0)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (<= 1 ~M~0))) is different from false [2022-01-19 02:07:32,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (not .cse0) (= .cse1 c_~max2~0)) (or (= c_~max1~0 c_~max2~0) .cse0)))) (<= (+ ~M~0 1) 0) (and (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2))))) (<= 1 ~M~0))) is different from false [2022-01-19 02:07:34,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (= c_~max1~0 c_~max2~0) .cse0) (or (not .cse0) (= .cse1 c_~max2~0))))) (and (or (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)))))) (<= 1 ~M~0))) is different from false [2022-01-19 02:07:45,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 02:07:45,954 INFO L387 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 177 treesize of output 117 [2022-01-19 02:07:45,988 INFO L353 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-01-19 02:07:45,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2555 treesize of output 2421 [2022-01-19 02:07:46,027 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-01-19 02:07:46,028 INFO L387 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 2421 treesize of output 2323 [2022-01-19 02:07:46,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2246 treesize of output 2150 [2022-01-19 02:07:46,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2150 treesize of output 1958 [2022-01-19 02:07:46,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1958 treesize of output 1766 [2022-01-19 02:07:46,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1766 treesize of output 1670 [2022-01-19 02:07:46,179 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-19 02:07:46,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 02:07:46,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:07:46,380 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-19 02:07:46,382 INFO L158 Benchmark]: Toolchain (without parser) took 97715.62ms. Allocated memory was 381.7MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 328.1MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2022-01-19 02:07:46,382 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 381.7MB. Free memory is still 345.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 02:07:46,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.89ms. Allocated memory is still 381.7MB. Free memory was 327.9MB in the beginning and 353.3MB in the end (delta: -25.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.0GB. [2022-01-19 02:07:46,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.49ms. Allocated memory is still 381.7MB. Free memory was 353.3MB in the beginning and 351.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 02:07:46,383 INFO L158 Benchmark]: Boogie Preprocessor took 23.38ms. Allocated memory is still 381.7MB. Free memory was 351.2MB in the beginning and 350.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 02:07:46,383 INFO L158 Benchmark]: RCFGBuilder took 401.89ms. Allocated memory is still 381.7MB. Free memory was 350.2MB in the beginning and 330.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 02:07:46,383 INFO L158 Benchmark]: TraceAbstraction took 97080.90ms. Allocated memory was 381.7MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 330.2MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2022-01-19 02:07:46,384 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 381.7MB. Free memory is still 345.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 176.89ms. Allocated memory is still 381.7MB. Free memory was 327.9MB in the beginning and 353.3MB in the end (delta: -25.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 21.49ms. Allocated memory is still 381.7MB. Free memory was 353.3MB in the beginning and 351.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.38ms. Allocated memory is still 381.7MB. Free memory was 351.2MB in the beginning and 350.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 401.89ms. Allocated memory is still 381.7MB. Free memory was 350.2MB in the beginning and 330.2MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 97080.90ms. Allocated memory was 381.7MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 330.2MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-19 02:07:46,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...