/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-07 16:37:34,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-07 16:37:34,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-07 16:37:34,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-07 16:37:34,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-07 16:37:34,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-07 16:37:34,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-07 16:37:34,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-07 16:37:34,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-07 16:37:34,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-07 16:37:34,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-07 16:37:34,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-07 16:37:34,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-07 16:37:34,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-07 16:37:34,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-07 16:37:34,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-07 16:37:34,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-07 16:37:34,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-07 16:37:34,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-07 16:37:34,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-07 16:37:34,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-07 16:37:34,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-07 16:37:34,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-07 16:37:34,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-07 16:37:34,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-07 16:37:34,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-07 16:37:34,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-07 16:37:34,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-07 16:37:34,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-07 16:37:34,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-07 16:37:34,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-07 16:37:34,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-07 16:37:34,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-07 16:37:34,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-07 16:37:34,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-07 16:37:34,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-07 16:37:34,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-07 16:37:34,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-07 16:37:34,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-07 16:37:34,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-07 16:37:34,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-07 16:37:34,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-07 16:37:34,745 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-07 16:37:34,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-07 16:37:34,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-07 16:37:34,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-07 16:37:34,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-07 16:37:34,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-07 16:37:34,751 INFO L138 SettingsManager]: * Use SBE=true [2021-10-07 16:37:34,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-07 16:37:34,752 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-07 16:37:34,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-07 16:37:34,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-07 16:37:34,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-07 16:37:34,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-07 16:37:34,754 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-07 16:37:34,754 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-07 16:37:34,754 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-07 16:37:34,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-07 16:37:34,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-07 16:37:34,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-07 16:37:34,755 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-07 16:37:34,755 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-07 16:37:34,755 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-07 16:37:34,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-07 16:37:34,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-07 16:37:34,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-07 16:37:34,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 16:37:34,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-07 16:37:34,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-07 16:37:34,757 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-07 16:37:34,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-07 16:37:34,757 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-07 16:37:34,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-07 16:37:34,758 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-2/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 [2021-10-07 16:37:35,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-07 16:37:35,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-07 16:37:35,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-07 16:37:35,230 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-07 16:37:35,230 INFO L275 PluginConnector]: CDTParser initialized [2021-10-07 16:37:35,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2021-10-07 16:37:35,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ff2506f8e/0a873a8fdf7a46d0af9043b037cdeb51/FLAGaa0d3048d [2021-10-07 16:37:36,048 INFO L306 CDTParser]: Found 1 translation units. [2021-10-07 16:37:36,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2021-10-07 16:37:36,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ff2506f8e/0a873a8fdf7a46d0af9043b037cdeb51/FLAGaa0d3048d [2021-10-07 16:37:36,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ff2506f8e/0a873a8fdf7a46d0af9043b037cdeb51 [2021-10-07 16:37:36,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-07 16:37:36,416 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-07 16:37:36,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-07 16:37:36,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-07 16:37:36,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-07 16:37:36,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab11d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36, skipping insertion in model container [2021-10-07 16:37:36,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-07 16:37:36,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-07 16:37:36,690 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2643,2656] [2021-10-07 16:37:36,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 16:37:36,716 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-10-07 16:37:36,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-07 16:37:36,743 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2643,2656] [2021-10-07 16:37:36,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 16:37:36,770 INFO L203 MainTranslator]: Completed pre-run [2021-10-07 16:37:36,798 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c[2643,2656] [2021-10-07 16:37:36,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-07 16:37:36,822 INFO L208 MainTranslator]: Completed translation [2021-10-07 16:37:36,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36 WrapperNode [2021-10-07 16:37:36,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-07 16:37:36,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-07 16:37:36,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-07 16:37:36,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-07 16:37:36,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-07 16:37:36,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-07 16:37:36,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-07 16:37:36,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-07 16:37:36,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-07 16:37:36,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-07 16:37:36,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-07 16:37:36,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-07 16:37:36,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (1/1) ... [2021-10-07 16:37:36,945 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-07 16:37:36,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-07 16:37:36,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-07 16:37:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-07 16:37:37,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-07 16:37:37,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-07 16:37:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-07 16:37:37,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-07 16:37:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-07 16:37:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-07 16:37:37,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-07 16:37:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-07 16:37:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-07 16:37:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-07 16:37:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-07 16:37:37,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-07 16:37:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-07 16:37:37,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-07 16:37:37,044 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-07 16:37:38,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-07 16:37:38,171 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-10-07 16:37:38,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 04:37:38 BoogieIcfgContainer [2021-10-07 16:37:38,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-07 16:37:38,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-07 16:37:38,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-07 16:37:38,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-07 16:37:38,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 04:37:36" (1/3) ... [2021-10-07 16:37:38,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1022dafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 04:37:38, skipping insertion in model container [2021-10-07 16:37:38,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 04:37:36" (2/3) ... [2021-10-07 16:37:38,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1022dafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 04:37:38, skipping insertion in model container [2021-10-07 16:37:38,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 04:37:38" (3/3) ... [2021-10-07 16:37:38,183 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2021-10-07 16:37:38,190 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-07 16:37:38,190 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-10-07 16:37:38,190 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-07 16:37:38,226 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,227 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,229 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,229 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,230 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,230 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,230 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,230 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,231 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,232 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,233 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,233 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,233 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,233 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,234 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,234 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,234 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,234 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,236 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,236 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,236 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,236 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,236 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,237 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,237 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,237 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,240 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,241 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,246 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~b~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,252 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-07 16:37:38,257 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-07 16:37:38,306 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-07 16:37:38,314 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-07 16:37:38,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-10-07 16:37:38,334 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-07 16:37:38,347 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions, 288 flow [2021-10-07 16:37:38,351 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 136 transitions, 288 flow [2021-10-07 16:37:38,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 288 flow [2021-10-07 16:37:38,415 INFO L129 PetriNetUnfolder]: 11/134 cut-off events. [2021-10-07 16:37:38,416 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-07 16:37:38,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 134 events. 11/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 152 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2021-10-07 16:37:38,424 INFO L116 LiptonReduction]: Number of co-enabled transitions 1180 [2021-10-07 16:37:57,476 INFO L131 LiptonReduction]: Checked pairs total: 1528 [2021-10-07 16:37:57,476 INFO L133 LiptonReduction]: Total number of compositions: 152 [2021-10-07 16:37:57,486 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 36 transitions, 88 flow [2021-10-07 16:37:57,507 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 166 states, 100 states have (on average 4.07) internal successors, (407), 165 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 100 states have (on average 4.07) internal successors, (407), 165 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 16:37:57,516 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:37:57,517 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 16:37:57,517 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:37:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:37:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 19490, now seen corresponding path program 1 times [2021-10-07 16:37:57,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:37:57,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659782001] [2021-10-07 16:37:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:37:57,538 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:37:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:37:57,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:37:57,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-07 16:37:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:37:57,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-07 16:37:57,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:37:57,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:37:57,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:37:58,029 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:37:58,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:37:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:37:58,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:37:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:37:58,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:37:58,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659782001] [2021-10-07 16:37:58,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659782001] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:37:58,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:37:58,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:37:58,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552453725] [2021-10-07 16:37:58,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:37:58,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:37:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:37:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:37:58,280 INFO L87 Difference]: Start difference. First operand has 166 states, 100 states have (on average 4.07) internal successors, (407), 165 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:37:58,709 INFO L93 Difference]: Finished difference Result 330 states and 815 transitions. [2021-10-07 16:37:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 16:37:58,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-07 16:37:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:37:58,729 INFO L225 Difference]: With dead ends: 330 [2021-10-07 16:37:58,729 INFO L226 Difference]: Without dead ends: 330 [2021-10-07 16:37:58,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:37:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-07 16:37:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 167. [2021-10-07 16:37:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 102 states have (on average 4.078431372549019) internal successors, (416), 166 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 416 transitions. [2021-10-07 16:37:58,794 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 416 transitions. Word has length 2 [2021-10-07 16:37:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:37:58,795 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 416 transitions. [2021-10-07 16:37:58,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 416 transitions. [2021-10-07 16:37:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 16:37:58,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:37:58,796 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 16:37:58,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-07 16:37:59,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:37:59,008 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:37:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:37:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 19491, now seen corresponding path program 1 times [2021-10-07 16:37:59,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:37:59,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036298274] [2021-10-07 16:37:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:37:59,011 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:37:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:37:59,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:37:59,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-07 16:37:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:37:59,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-07 16:37:59,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:37:59,248 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-07 16:37:59,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 59 [2021-10-07 16:37:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:37:59,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:37:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:37:59,767 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:37:59,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036298274] [2021-10-07 16:37:59,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036298274] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:37:59,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:37:59,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-07 16:37:59,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646940221] [2021-10-07 16:37:59,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 16:37:59,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:37:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 16:37:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 16:37:59,772 INFO L87 Difference]: Start difference. First operand 167 states and 416 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:37:59,886 INFO L93 Difference]: Finished difference Result 166 states and 413 transitions. [2021-10-07 16:37:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:37:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-07 16:37:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:37:59,889 INFO L225 Difference]: With dead ends: 166 [2021-10-07 16:37:59,889 INFO L226 Difference]: Without dead ends: 166 [2021-10-07 16:37:59,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 16:37:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-07 16:37:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-10-07 16:37:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 102 states have (on average 4.049019607843137) internal successors, (413), 165 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 413 transitions. [2021-10-07 16:37:59,906 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 413 transitions. Word has length 2 [2021-10-07 16:37:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:37:59,906 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 413 transitions. [2021-10-07 16:37:59,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:37:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 413 transitions. [2021-10-07 16:37:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 16:37:59,907 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:37:59,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 16:37:59,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:00,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:00,122 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash 19591, now seen corresponding path program 1 times [2021-10-07 16:38:00,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:00,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056060238] [2021-10-07 16:38:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:00,125 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:00,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:00,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:00,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-07 16:38:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:00,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-07 16:38:00,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:00,375 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-07 16:38:00,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 105 treesize of output 138 [2021-10-07 16:38:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:01,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:02,004 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:02,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056060238] [2021-10-07 16:38:02,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056060238] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:02,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:02,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:38:02,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911757283] [2021-10-07 16:38:02,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:02,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:02,008 INFO L87 Difference]: Start difference. First operand 166 states and 413 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:02,118 INFO L93 Difference]: Finished difference Result 137 states and 326 transitions. [2021-10-07 16:38:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-07 16:38:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:02,123 INFO L225 Difference]: With dead ends: 137 [2021-10-07 16:38:02,124 INFO L226 Difference]: Without dead ends: 137 [2021-10-07 16:38:02,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-07 16:38:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-07 16:38:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 3.662921348314607) internal successors, (326), 136 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 326 transitions. [2021-10-07 16:38:02,151 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 326 transitions. Word has length 2 [2021-10-07 16:38:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:02,151 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 326 transitions. [2021-10-07 16:38:02,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 326 transitions. [2021-10-07 16:38:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-07 16:38:02,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:02,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-07 16:38:02,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:02,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:02,360 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash 19592, now seen corresponding path program 1 times [2021-10-07 16:38:02,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:02,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271265451] [2021-10-07 16:38:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:02,364 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:02,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:02,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-07 16:38:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:02,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-07 16:38:02,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:02,649 INFO L354 Elim1Store]: treesize reduction 151, result has 21.8 percent of original size [2021-10-07 16:38:02,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 74 [2021-10-07 16:38:02,658 INFO L388 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 96 treesize of output 94 [2021-10-07 16:38:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:03,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:03,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:03,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271265451] [2021-10-07 16:38:03,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271265451] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:03,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:03,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:38:03,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625087991] [2021-10-07 16:38:03,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:03,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:03,082 INFO L87 Difference]: Start difference. First operand 137 states and 326 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:03,204 INFO L93 Difference]: Finished difference Result 108 states and 239 transitions. [2021-10-07 16:38:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-07 16:38:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:03,206 INFO L225 Difference]: With dead ends: 108 [2021-10-07 16:38:03,206 INFO L226 Difference]: Without dead ends: 108 [2021-10-07 16:38:03,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-07 16:38:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-10-07 16:38:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 3.1447368421052633) internal successors, (239), 107 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 239 transitions. [2021-10-07 16:38:03,214 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 239 transitions. Word has length 2 [2021-10-07 16:38:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:03,214 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 239 transitions. [2021-10-07 16:38:03,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 239 transitions. [2021-10-07 16:38:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 16:38:03,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:03,215 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-07 16:38:03,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:03,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:03,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash 18827810, now seen corresponding path program 1 times [2021-10-07 16:38:03,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:03,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389717912] [2021-10-07 16:38:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:03,425 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:03,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:03,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-07 16:38:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:03,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-07 16:38:03,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:03,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:03,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:03,684 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:38:03,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:38:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:03,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:04,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:04,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389717912] [2021-10-07 16:38:04,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389717912] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:38:04,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:38:04,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-07 16:38:04,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140836891] [2021-10-07 16:38:04,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-07 16:38:04,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-07 16:38:04,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-07 16:38:04,461 INFO L87 Difference]: Start difference. First operand 108 states and 239 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:06,042 INFO L93 Difference]: Finished difference Result 627 states and 1402 transitions. [2021-10-07 16:38:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-07 16:38:06,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-07 16:38:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:06,055 INFO L225 Difference]: With dead ends: 627 [2021-10-07 16:38:06,055 INFO L226 Difference]: Without dead ends: 627 [2021-10-07 16:38:06,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1008.6ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-10-07 16:38:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-10-07 16:38:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 112. [2021-10-07 16:38:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 3.0875) internal successors, (247), 111 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 247 transitions. [2021-10-07 16:38:06,083 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 247 transitions. Word has length 4 [2021-10-07 16:38:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:06,084 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 247 transitions. [2021-10-07 16:38:06,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 247 transitions. [2021-10-07 16:38:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 16:38:06,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:06,086 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-07 16:38:06,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:06,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:06,300 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 18842641, now seen corresponding path program 1 times [2021-10-07 16:38:06,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:06,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354891022] [2021-10-07 16:38:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:06,302 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:06,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:06,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:06,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-07 16:38:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:06,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 16:38:06,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:06,517 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-07 16:38:06,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 59 [2021-10-07 16:38:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:06,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:06,949 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:06,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354891022] [2021-10-07 16:38:06,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354891022] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:06,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:06,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-07 16:38:06,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816194649] [2021-10-07 16:38:06,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:06,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:06,952 INFO L87 Difference]: Start difference. First operand 112 states and 247 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:07,071 INFO L93 Difference]: Finished difference Result 74 states and 158 transitions. [2021-10-07 16:38:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 16:38:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-07 16:38:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:07,072 INFO L225 Difference]: With dead ends: 74 [2021-10-07 16:38:07,072 INFO L226 Difference]: Without dead ends: 74 [2021-10-07 16:38:07,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-07 16:38:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-07 16:38:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-10-07 16:38:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 2.7719298245614037) internal successors, (158), 73 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 158 transitions. [2021-10-07 16:38:07,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 158 transitions. Word has length 4 [2021-10-07 16:38:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:07,077 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 158 transitions. [2021-10-07 16:38:07,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 158 transitions. [2021-10-07 16:38:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 16:38:07,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:07,078 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-07 16:38:07,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:07,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:07,279 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 18842642, now seen corresponding path program 1 times [2021-10-07 16:38:07,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:07,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129785502] [2021-10-07 16:38:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:07,282 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:07,284 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:07,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-07 16:38:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:07,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 16:38:07,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:07,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:07,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:07,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129785502] [2021-10-07 16:38:07,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129785502] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:07,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:07,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:38:07,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185535414] [2021-10-07 16:38:07,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:07,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:07,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:07,404 INFO L87 Difference]: Start difference. First operand 74 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:07,480 INFO L93 Difference]: Finished difference Result 102 states and 205 transitions. [2021-10-07 16:38:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-07 16:38:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:07,483 INFO L225 Difference]: With dead ends: 102 [2021-10-07 16:38:07,483 INFO L226 Difference]: Without dead ends: 102 [2021-10-07 16:38:07,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-07 16:38:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 76. [2021-10-07 16:38:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 2.6065573770491803) internal successors, (159), 75 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 159 transitions. [2021-10-07 16:38:07,488 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 159 transitions. Word has length 4 [2021-10-07 16:38:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:07,489 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 159 transitions. [2021-10-07 16:38:07,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 159 transitions. [2021-10-07 16:38:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 16:38:07,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:07,490 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-07 16:38:07,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:07,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:07,705 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 18842662, now seen corresponding path program 1 times [2021-10-07 16:38:07,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:07,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675279324] [2021-10-07 16:38:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:07,708 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:07,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:07,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:07,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-07 16:38:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:07,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-07 16:38:07,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:07,920 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-07 16:38:07,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 59 [2021-10-07 16:38:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:08,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:08,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:08,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675279324] [2021-10-07 16:38:08,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675279324] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:08,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:08,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-07 16:38:08,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367498735] [2021-10-07 16:38:08,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-07 16:38:08,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-07 16:38:08,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 16:38:08,380 INFO L87 Difference]: Start difference. First operand 76 states and 159 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:08,468 INFO L93 Difference]: Finished difference Result 69 states and 146 transitions. [2021-10-07 16:38:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-07 16:38:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:08,469 INFO L225 Difference]: With dead ends: 69 [2021-10-07 16:38:08,469 INFO L226 Difference]: Without dead ends: 69 [2021-10-07 16:38:08,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-07 16:38:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-07 16:38:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-07 16:38:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 68 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 146 transitions. [2021-10-07 16:38:08,474 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 146 transitions. Word has length 4 [2021-10-07 16:38:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:08,474 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 146 transitions. [2021-10-07 16:38:08,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 146 transitions. [2021-10-07 16:38:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-07 16:38:08,475 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:08,475 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-07 16:38:08,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:08,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:08,678 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 18842663, now seen corresponding path program 1 times [2021-10-07 16:38:08,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:08,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973293332] [2021-10-07 16:38:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:08,680 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:08,682 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:08,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-07 16:38:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:08,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 16:38:08,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:08,924 INFO L354 Elim1Store]: treesize reduction 155, result has 19.7 percent of original size [2021-10-07 16:38:08,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 65 [2021-10-07 16:38:08,931 INFO L388 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 92 treesize of output 90 [2021-10-07 16:38:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:11,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:11,477 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:11,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973293332] [2021-10-07 16:38:11,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973293332] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:11,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:11,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:38:11,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413819257] [2021-10-07 16:38:11,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:11,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:11,480 INFO L87 Difference]: Start difference. First operand 69 states and 146 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:11,590 INFO L93 Difference]: Finished difference Result 62 states and 133 transitions. [2021-10-07 16:38:11,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:11,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-07 16:38:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:11,592 INFO L225 Difference]: With dead ends: 62 [2021-10-07 16:38:11,593 INFO L226 Difference]: Without dead ends: 62 [2021-10-07 16:38:11,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2049.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-07 16:38:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-07 16:38:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 2.418181818181818) internal successors, (133), 61 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 133 transitions. [2021-10-07 16:38:11,596 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 133 transitions. Word has length 4 [2021-10-07 16:38:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:11,597 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 133 transitions. [2021-10-07 16:38:11,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 133 transitions. [2021-10-07 16:38:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-07 16:38:11,598 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:11,598 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:38:11,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:11,808 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1298487222, now seen corresponding path program 1 times [2021-10-07 16:38:11,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:11,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774460954] [2021-10-07 16:38:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:11,811 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:11,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:11,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:11,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-07 16:38:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:11,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-07 16:38:11,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:11,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:12,030 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:12,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774460954] [2021-10-07 16:38:12,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774460954] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:12,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:12,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-07 16:38:12,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462224900] [2021-10-07 16:38:12,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-07 16:38:12,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:12,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-07 16:38:12,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-07 16:38:12,032 INFO L87 Difference]: Start difference. First operand 62 states and 133 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:12,187 INFO L93 Difference]: Finished difference Result 87 states and 172 transitions. [2021-10-07 16:38:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-07 16:38:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-07 16:38:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:12,190 INFO L225 Difference]: With dead ends: 87 [2021-10-07 16:38:12,190 INFO L226 Difference]: Without dead ends: 87 [2021-10-07 16:38:12,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-07 16:38:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-07 16:38:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2021-10-07 16:38:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 2.2777777777777777) internal successors, (164), 78 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 164 transitions. [2021-10-07 16:38:12,194 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 164 transitions. Word has length 7 [2021-10-07 16:38:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:12,195 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 164 transitions. [2021-10-07 16:38:12,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 164 transitions. [2021-10-07 16:38:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-07 16:38:12,196 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:12,196 INFO L512 BasicCegarLoop]: trace histogram [6, 1, 1] [2021-10-07 16:38:12,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:12,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:12,397 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1944503842, now seen corresponding path program 2 times [2021-10-07 16:38:12,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:12,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001505398] [2021-10-07 16:38:12,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 16:38:12,400 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:12,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:12,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-07 16:38:12,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-07 16:38:12,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 16:38:12,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-07 16:38:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:12,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:12,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:12,697 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:38:12,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:38:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:13,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:14,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:14,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001505398] [2021-10-07 16:38:14,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001505398] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:38:14,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:38:14,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2021-10-07 16:38:14,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404416210] [2021-10-07 16:38:14,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-07 16:38:14,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-07 16:38:14,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-10-07 16:38:14,728 INFO L87 Difference]: Start difference. First operand 79 states and 164 transitions. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:22,189 INFO L93 Difference]: Finished difference Result 731 states and 1592 transitions. [2021-10-07 16:38:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-07 16:38:22,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-07 16:38:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:22,196 INFO L225 Difference]: With dead ends: 731 [2021-10-07 16:38:22,197 INFO L226 Difference]: Without dead ends: 731 [2021-10-07 16:38:22,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5794.6ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-10-07 16:38:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-10-07 16:38:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 87. [2021-10-07 16:38:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 2.25) internal successors, (180), 86 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. [2021-10-07 16:38:22,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 8 [2021-10-07 16:38:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:22,214 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. [2021-10-07 16:38:22,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. [2021-10-07 16:38:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-07 16:38:22,216 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:22,217 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:38:22,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:22,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:22,430 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1910561190, now seen corresponding path program 1 times [2021-10-07 16:38:22,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:22,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400870924] [2021-10-07 16:38:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:22,432 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:22,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:22,434 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:22,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-07 16:38:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:22,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-07 16:38:22,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:22,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:22,732 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:38:22,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:38:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:23,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:23,957 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:23,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400870924] [2021-10-07 16:38:23,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400870924] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:38:23,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:38:23,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-07 16:38:23,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667190757] [2021-10-07 16:38:23,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-07 16:38:23,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-07 16:38:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-07 16:38:23,959 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:25,914 INFO L93 Difference]: Finished difference Result 153 states and 306 transitions. [2021-10-07 16:38:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-07 16:38:25,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-07 16:38:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:25,917 INFO L225 Difference]: With dead ends: 153 [2021-10-07 16:38:25,918 INFO L226 Difference]: Without dead ends: 153 [2021-10-07 16:38:25,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1445.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-07 16:38:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-10-07 16:38:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 108. [2021-10-07 16:38:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 2.287128712871287) internal successors, (231), 107 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 231 transitions. [2021-10-07 16:38:25,923 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 231 transitions. Word has length 8 [2021-10-07 16:38:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:25,924 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 231 transitions. [2021-10-07 16:38:25,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 231 transitions. [2021-10-07 16:38:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-07 16:38:25,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:25,925 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:38:25,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-10-07 16:38:26,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:26,137 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1361990582, now seen corresponding path program 2 times [2021-10-07 16:38:26,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:26,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642978598] [2021-10-07 16:38:26,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 16:38:26,140 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:26,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:26,141 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:26,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-07 16:38:26,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-07 16:38:26,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 16:38:26,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-07 16:38:26,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:26,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:26,436 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:38:26,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:38:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-07 16:38:26,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-07 16:38:27,591 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:27,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642978598] [2021-10-07 16:38:27,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642978598] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:27,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:27,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-07 16:38:27,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840398577] [2021-10-07 16:38:27,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-07 16:38:27,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-07 16:38:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-07 16:38:27,594 INFO L87 Difference]: Start difference. First operand 108 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:27,741 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2021-10-07 16:38:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-07 16:38:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-07 16:38:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:27,743 INFO L225 Difference]: With dead ends: 84 [2021-10-07 16:38:27,743 INFO L226 Difference]: Without dead ends: 84 [2021-10-07 16:38:27,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 127.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-07 16:38:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-07 16:38:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2021-10-07 16:38:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 2.0) internal successors, (122), 62 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2021-10-07 16:38:27,747 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2021-10-07 16:38:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:27,747 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2021-10-07 16:38:27,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2021-10-07 16:38:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-07 16:38:27,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:27,749 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:38:27,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-10-07 16:38:27,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:27,962 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1719508240, now seen corresponding path program 1 times [2021-10-07 16:38:27,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:27,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183062217] [2021-10-07 16:38:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:38:27,963 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:27,964 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:27,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-07 16:38:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:38:28,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-07 16:38:28,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:28,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:28,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:28,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183062217] [2021-10-07 16:38:28,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183062217] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-07 16:38:28,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-07 16:38:28,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-07 16:38:28,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023747860] [2021-10-07 16:38:28,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-07 16:38:28,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-07 16:38:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:28,184 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:38:28,208 INFO L93 Difference]: Finished difference Result 76 states and 151 transitions. [2021-10-07 16:38:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-07 16:38:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-07 16:38:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:38:28,209 INFO L225 Difference]: With dead ends: 76 [2021-10-07 16:38:28,209 INFO L226 Difference]: Without dead ends: 42 [2021-10-07 16:38:28,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-07 16:38:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-10-07 16:38:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-10-07 16:38:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 2.0) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. [2021-10-07 16:38:28,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 13 [2021-10-07 16:38:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:38:28,213 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 80 transitions. [2021-10-07 16:38:28,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 80 transitions. [2021-10-07 16:38:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-07 16:38:28,214 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:38:28,214 INFO L512 BasicCegarLoop]: trace histogram [14, 1, 1] [2021-10-07 16:38:28,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-07 16:38:28,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:38:28,423 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:38:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:38:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -535052766, now seen corresponding path program 3 times [2021-10-07 16:38:28,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:38:28,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349384550] [2021-10-07 16:38:28,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-07 16:38:28,425 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:38:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:38:28,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:38:28,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-07 16:38:28,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-10-07 16:38:28,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 16:38:28,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-07 16:38:28,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:38:28,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:28,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-07 16:38:28,943 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-07 16:38:28,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 59 [2021-10-07 16:38:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:29,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:38:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:38:36,909 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:38:36,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349384550] [2021-10-07 16:38:36,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349384550] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:38:36,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:38:36,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2021-10-07 16:38:36,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650041033] [2021-10-07 16:38:36,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-10-07 16:38:36,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:38:36,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-10-07 16:38:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-10-07 16:38:36,912 INFO L87 Difference]: Start difference. First operand 42 states and 80 transitions. Second operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:38:50,251 WARN L207 SmtUtils]: Spent 10.12 s on a formula simplification that was a NOOP. DAG size: 168 [2021-10-07 16:39:00,160 WARN L207 SmtUtils]: Spent 8.97 s on a formula simplification that was a NOOP. DAG size: 157 [2021-10-07 16:39:12,283 WARN L207 SmtUtils]: Spent 5.79 s on a formula simplification that was a NOOP. DAG size: 136 [2021-10-07 16:39:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:39:35,871 INFO L93 Difference]: Finished difference Result 758 states and 1484 transitions. [2021-10-07 16:39:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-07 16:39:35,873 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-07 16:39:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:39:35,878 INFO L225 Difference]: With dead ends: 758 [2021-10-07 16:39:35,878 INFO L226 Difference]: Without dead ends: 758 [2021-10-07 16:39:35,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 57460.7ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-10-07 16:39:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-10-07 16:39:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 58. [2021-10-07 16:39:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 2.0) internal successors, (112), 57 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:39:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 112 transitions. [2021-10-07 16:39:35,889 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 112 transitions. Word has length 16 [2021-10-07 16:39:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:39:35,890 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 112 transitions. [2021-10-07 16:39:35,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:39:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 112 transitions. [2021-10-07 16:39:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-07 16:39:35,891 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:39:35,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:39:35,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-07 16:39:36,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:39:36,105 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:39:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:39:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1380605847, now seen corresponding path program 1 times [2021-10-07 16:39:36,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:39:36,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101601641] [2021-10-07 16:39:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-07 16:39:36,107 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:39:36,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:39:36,109 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:39:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-07 16:39:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-07 16:39:36,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-07 16:39:36,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:39:36,409 INFO L388 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 10 treesize of output 8 [2021-10-07 16:39:36,440 INFO L388 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 8 treesize of output 6 [2021-10-07 16:39:36,579 INFO L354 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2021-10-07 16:39:36,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 31 [2021-10-07 16:39:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 16:39:36,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:39:37,093 INFO L354 Elim1Store]: treesize reduction 442, result has 10.0 percent of original size [2021-10-07 16:39:37,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 264 treesize of output 172 [2021-10-07 16:39:37,101 INFO L388 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 172 treesize of output 168 [2021-10-07 16:39:37,105 INFO L388 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 168 treesize of output 164 [2021-10-07 16:40:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-07 16:40:08,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:40:08,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101601641] [2021-10-07 16:40:08,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101601641] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:40:08,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:40:08,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2021-10-07 16:40:08,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600130372] [2021-10-07 16:40:08,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-07 16:40:08,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:40:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-07 16:40:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-07 16:40:08,177 INFO L87 Difference]: Start difference. First operand 58 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:40:08,654 INFO L93 Difference]: Finished difference Result 71 states and 141 transitions. [2021-10-07 16:40:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-07 16:40:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-07 16:40:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:40:08,655 INFO L225 Difference]: With dead ends: 71 [2021-10-07 16:40:08,656 INFO L226 Difference]: Without dead ends: 62 [2021-10-07 16:40:08,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 608.8ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-07 16:40:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-07 16:40:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-07 16:40:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 2.033333333333333) internal successors, (122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2021-10-07 16:40:08,658 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 122 transitions. Word has length 16 [2021-10-07 16:40:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:40:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 122 transitions. [2021-10-07 16:40:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 122 transitions. [2021-10-07 16:40:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-07 16:40:08,660 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:40:08,660 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:40:08,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-07 16:40:08,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:40:08,861 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:40:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:40:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -917937563, now seen corresponding path program 2 times [2021-10-07 16:40:08,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:40:08,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795026574] [2021-10-07 16:40:08,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-07 16:40:08,863 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:40:08,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:40:08,865 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:40:08,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-10-07 16:40:09,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-07 16:40:09,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 16:40:09,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-07 16:40:09,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:40:09,303 INFO L388 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 75 treesize of output 73 [2021-10-07 16:40:09,315 INFO L354 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2021-10-07 16:40:09,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 30 [2021-10-07 16:40:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:40:09,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:40:09,768 INFO L354 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2021-10-07 16:40:09,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 329 treesize of output 189 [2021-10-07 16:40:09,777 INFO L388 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 189 treesize of output 185 [2021-10-07 16:40:09,784 INFO L388 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 185 treesize of output 181 [2021-10-07 16:40:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-07 16:40:10,464 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-07 16:40:10,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795026574] [2021-10-07 16:40:10,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795026574] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-07 16:40:10,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-07 16:40:10,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2021-10-07 16:40:10,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207152479] [2021-10-07 16:40:10,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-07 16:40:10,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-07 16:40:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-07 16:40:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-10-07 16:40:10,466 INFO L87 Difference]: Start difference. First operand 62 states and 122 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-07 16:40:11,132 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2021-10-07 16:40:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-07 16:40:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-07 16:40:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-07 16:40:11,134 INFO L225 Difference]: With dead ends: 117 [2021-10-07 16:40:11,134 INFO L226 Difference]: Without dead ends: 98 [2021-10-07 16:40:11,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 856.9ms TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2021-10-07 16:40:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-07 16:40:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2021-10-07 16:40:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 2.1447368421052633) internal successors, (163), 77 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 163 transitions. [2021-10-07 16:40:11,138 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 163 transitions. Word has length 17 [2021-10-07 16:40:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-07 16:40:11,138 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 163 transitions. [2021-10-07 16:40:11,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-07 16:40:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 163 transitions. [2021-10-07 16:40:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-07 16:40:11,139 INFO L504 BasicCegarLoop]: Found error trace [2021-10-07 16:40:11,139 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-07 16:40:11,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-10-07 16:40:11,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:40:11,344 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 22 more)] === [2021-10-07 16:40:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-07 16:40:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1290376896, now seen corresponding path program 3 times [2021-10-07 16:40:11,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-07 16:40:11,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237001399] [2021-10-07 16:40:11,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-07 16:40:11,346 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-07 16:40:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-07 16:40:11,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-07 16:40:11,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-10-07 16:40:11,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-07 16:40:11,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-07 16:40:11,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-07 16:40:11,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-07 16:40:12,234 INFO L388 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 20 treesize of output 16 [2021-10-07 16:40:12,274 INFO L388 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 8 treesize of output 6 [2021-10-07 16:40:12,696 INFO L354 Elim1Store]: treesize reduction 497, result has 0.2 percent of original size [2021-10-07 16:40:12,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 204 treesize of output 62 [2021-10-07 16:40:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-07 16:40:12,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-07 16:40:18,571 INFO L354 Elim1Store]: treesize reduction 1907, result has 9.9 percent of original size [2021-10-07 16:40:18,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 690 treesize of output 546 [2021-10-07 16:40:18,581 INFO L388 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 546 treesize of output 538 [2021-10-07 16:40:18,590 INFO L388 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 538 treesize of output 530 Received shutdown request... [2021-10-07 16:51:30,651 WARN L223 SmtUtils]: Removed 1 from assertion stack [2021-10-07 16:51:30,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-10-07 16:51:30,654 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK [2021-10-07 16:51:30,654 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-10-07 16:51:30,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-10-07 16:51:30,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-07 16:51:30,860 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. [2021-10-07 16:51:30,863 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-07 16:51:30,863 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-07 16:51:30,863 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-07 16:51:30,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-07 16:51:30,865 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-07 16:51:30,866 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-07 16:51:30,866 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-07 16:51:30,866 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATION [2021-10-07 16:51:30,866 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATION [2021-10-07 16:51:30,872 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-07 16:51:30,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-07 16:51:30,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 04:51:30 BasicIcfg [2021-10-07 16:51:30,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-07 16:51:30,875 INFO L168 Benchmark]: Toolchain (without parser) took 834465.38 ms. Allocated memory was 177.2 MB in the beginning and 226.5 MB in the end (delta: 49.3 MB). Free memory was 150.6 MB in the beginning and 153.3 MB in the end (delta: -2.7 MB). Peak memory consumption was 139.0 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,875 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 177.2 MB. Free memory is still 147.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-07 16:51:30,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.22 ms. Allocated memory is still 177.2 MB. Free memory was 150.2 MB in the beginning and 137.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.48 ms. Allocated memory is still 177.2 MB. Free memory was 137.3 MB in the beginning and 135.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,876 INFO L168 Benchmark]: Boogie Preprocessor took 42.06 ms. Allocated memory is still 177.2 MB. Free memory was 135.5 MB in the beginning and 133.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,877 INFO L168 Benchmark]: RCFGBuilder took 1239.12 ms. Allocated memory is still 177.2 MB. Free memory was 133.7 MB in the beginning and 142.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,877 INFO L168 Benchmark]: TraceAbstraction took 832698.17 ms. Allocated memory was 177.2 MB in the beginning and 226.5 MB in the end (delta: 49.3 MB). Free memory was 141.9 MB in the beginning and 153.3 MB in the end (delta: -11.3 MB). Peak memory consumption was 129.0 MB. Max. memory is 8.0 GB. [2021-10-07 16:51:30,879 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.20 ms. Allocated memory is still 177.2 MB. Free memory is still 147.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 405.22 ms. Allocated memory is still 177.2 MB. Free memory was 150.2 MB in the beginning and 137.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 67.48 ms. Allocated memory is still 177.2 MB. Free memory was 137.3 MB in the beginning and 135.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.06 ms. Allocated memory is still 177.2 MB. Free memory was 135.5 MB in the beginning and 133.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1239.12 ms. Allocated memory is still 177.2 MB. Free memory was 133.7 MB in the beginning and 142.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 832698.17 ms. Allocated memory was 177.2 MB in the beginning and 226.5 MB in the end (delta: 49.3 MB). Free memory was 141.9 MB in the beginning and 153.3 MB in the end (delta: -11.3 MB). Peak memory consumption was 129.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19125.7ms, 132 PlacesBefore, 40 PlacesAfterwards, 136 TransitionsBefore, 36 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 7 FixpointIterations, 82 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 152 TotalNumberOfCompositions, 1528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1484, positive: 1467, positive conditional: 0, positive unconditional: 1467, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 688, positive: 683, positive conditional: 0, positive unconditional: 683, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 688, positive: 681, positive conditional: 0, positive unconditional: 681, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 740, positive: 383, positive conditional: 0, positive unconditional: 383, negative: 358, negative conditional: 0, negative unconditional: 358, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1484, positive: 784, positive conditional: 0, positive unconditional: 784, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 688, unknown conditional: 0, unknown unconditional: 688] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 157 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 832566.2ms, OverallIterations: 18, TraceHistogramMax: 14, EmptinessCheckTime: 21.4ms, AutomataDifference: 72722.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19192.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 427 SDtfs, 4898 SDslu, 2486 SDs, 0 SdLazy, 2644 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13583.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 69641.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=1, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 181.6ms AutomataMinimizationTime, 17 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 145.6ms SsaConstructionTime, 833.4ms SatisfiabilityAnalysisTime, 55437.4ms InterpolantComputationTime, 124 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 214 ConstructedInterpolants, 35 QuantifiedInterpolants, 4853 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 26/296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown