/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/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c503be2 [2021-10-13 21:49:02,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 21:49:02,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 21:49:02,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 21:49:02,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 21:49:02,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 21:49:02,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 21:49:02,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 21:49:02,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 21:49:02,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 21:49:02,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 21:49:02,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 21:49:02,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 21:49:02,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 21:49:02,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 21:49:02,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 21:49:02,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 21:49:02,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 21:49:02,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 21:49:02,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 21:49:02,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 21:49:02,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 21:49:02,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 21:49:02,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 21:49:02,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 21:49:02,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 21:49:02,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 21:49:02,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 21:49:02,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 21:49:02,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 21:49:02,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 21:49:02,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 21:49:02,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 21:49:02,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 21:49:02,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 21:49:02,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 21:49:02,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 21:49:02,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 21:49:02,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 21:49:02,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 21:49:02,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 21:49:02,318 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-10-13 21:49:02,377 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 21:49:02,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 21:49:02,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 21:49:02,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 21:49:02,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 21:49:02,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 21:49:02,381 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 21:49:02,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 21:49:02,382 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 21:49:02,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 21:49:02,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 21:49:02,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 21:49:02,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 21:49:02,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 21:49:02,385 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 21:49:02,385 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 21:49:02,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 21:49:02,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 21:49:02,386 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 21:49:02,386 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 21:49:02,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 21:49:02,387 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 21:49:02,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 21:49:02,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 21:49:02,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 21:49:02,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 21:49:02,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 21:49:02,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 21:49:02,389 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-13 21:49:02,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 21:49:02,390 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 21:49:02,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 21:49:02,390 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-13 21:49:02,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 21:49:02,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 21:49:02,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 21:49:02,810 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 21:49:02,811 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 21:49:02,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-4.wvr.c [2021-10-13 21:49:02,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8d5856821/1644ff8a41ed4938956aaf5aed49b4cc/FLAGf8db1aa19 [2021-10-13 21:49:03,652 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 21:49:03,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2021-10-13 21:49:03,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8d5856821/1644ff8a41ed4938956aaf5aed49b4cc/FLAGf8db1aa19 [2021-10-13 21:49:03,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8d5856821/1644ff8a41ed4938956aaf5aed49b4cc [2021-10-13 21:49:03,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 21:49:03,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 21:49:03,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 21:49:03,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 21:49:03,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 21:49:03,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:49:03" (1/1) ... [2021-10-13 21:49:03,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aae79fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:03, skipping insertion in model container [2021-10-13 21:49:03,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:49:03" (1/1) ... [2021-10-13 21:49:03,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 21:49:03,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 21:49:03,973 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/unroll-4.wvr.c[2572,2585] [2021-10-13 21:49:03,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 21:49:04,001 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-10-13 21:49:04,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 21:49:04,053 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/unroll-4.wvr.c[2572,2585] [2021-10-13 21:49:04,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 21:49:04,068 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 21:49:04,095 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/unroll-4.wvr.c[2572,2585] [2021-10-13 21:49:04,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 21:49:04,118 INFO L208 MainTranslator]: Completed translation [2021-10-13 21:49:04,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04 WrapperNode [2021-10-13 21:49:04,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 21:49:04,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 21:49:04,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 21:49:04,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 21:49:04,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 21:49:04,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 21:49:04,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 21:49:04,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 21:49:04,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 21:49:04,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 21:49:04,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 21:49:04,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 21:49:04,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (1/1) ... [2021-10-13 21:49:04,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 21:49:04,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-13 21:49:04,251 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-13 21:49:04,266 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-13 21:49:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-13 21:49:04,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-13 21:49:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-13 21:49:04,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-13 21:49:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 21:49:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 21:49:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 21:49:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-13 21:49:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 21:49:04,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 21:49:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 21:49:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-13 21:49:04,325 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 21:49:05,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 21:49:05,096 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-10-13 21:49:05,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:49:05 BoogieIcfgContainer [2021-10-13 21:49:05,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 21:49:05,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 21:49:05,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 21:49:05,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 21:49:05,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:49:03" (1/3) ... [2021-10-13 21:49:05,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa9ebe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:49:05, skipping insertion in model container [2021-10-13 21:49:05,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:49:04" (2/3) ... [2021-10-13 21:49:05,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa9ebe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:49:05, skipping insertion in model container [2021-10-13 21:49:05,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:49:05" (3/3) ... [2021-10-13 21:49:05,110 INFO L111 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2021-10-13 21:49:05,117 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 21:49:05,118 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2021-10-13 21:49:05,118 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 21:49:05,172 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,173 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,173 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,174 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,174 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,175 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,175 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,175 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,175 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,176 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,176 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,176 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,176 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,177 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,177 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,177 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,178 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,178 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,178 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,179 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,179 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,179 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,180 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,180 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,181 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,182 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,183 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,184 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,184 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,184 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,185 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,186 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,186 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,186 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,186 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,186 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,187 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,192 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,192 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,193 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,193 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,193 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,193 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,194 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,194 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,195 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,195 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,197 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,198 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,200 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,200 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,201 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,201 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,201 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,201 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,202 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,202 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,202 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,203 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,203 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,204 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,207 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,208 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,212 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,212 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,212 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,213 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,213 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,213 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,213 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,213 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,214 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,215 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,215 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,216 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,216 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,216 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,216 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,216 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,217 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,217 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,217 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,217 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,218 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,220 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,224 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,229 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,229 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,229 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,230 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,230 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,231 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,231 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,231 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,231 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,232 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,232 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,232 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,232 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,233 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,233 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,234 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,234 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,235 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,236 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,236 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,236 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,236 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,240 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,240 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,241 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,243 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,245 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,246 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,247 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,247 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,257 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,264 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,265 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,265 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,265 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,266 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,266 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 21:49:05,275 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-13 21:49:05,354 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 21:49:05,366 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-13 21:49:05,367 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-10-13 21:49:05,397 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 21:49:05,412 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 195 transitions, 406 flow [2021-10-13 21:49:05,418 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 195 transitions, 406 flow [2021-10-13 21:49:05,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 186 places, 195 transitions, 406 flow [2021-10-13 21:49:05,561 INFO L129 PetriNetUnfolder]: 16/193 cut-off events. [2021-10-13 21:49:05,561 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 21:49:05,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 193 events. 16/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 250 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2021-10-13 21:49:05,578 INFO L116 LiptonReduction]: Number of co-enabled transitions 4240 [2021-10-13 21:49:42,764 INFO L131 LiptonReduction]: Checked pairs total: 4487 [2021-10-13 21:49:42,764 INFO L133 LiptonReduction]: Total number of compositions: 229 [2021-10-13 21:49:42,779 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 41 transitions, 98 flow [2021-10-13 21:49:42,828 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 294 states, 184 states have (on average 4.043478260869565) internal successors, (744), 293 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 21:49:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 184 states have (on average 4.043478260869565) internal successors, (744), 293 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 21:49:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 21:49:42,844 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:42,845 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 21:49:42,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:42,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash 25501, now seen corresponding path program 1 times [2021-10-13 21:49:42,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:42,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567250274] [2021-10-13 21:49:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:42,867 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:42,870 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-13 21:49:42,886 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-13 21:49:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:42,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 21:49:42,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:43,281 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-13 21:49:43,282 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-13 21:49:43,780 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-13 21:49:43,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:43,786 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-13 21:49:43,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:43,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567250274] [2021-10-13 21:49:43,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567250274] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:43,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:43,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-13 21:49:43,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694112230] [2021-10-13 21:49:43,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 21:49:43,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:43,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 21:49:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 21:49:43,816 INFO L87 Difference]: Start difference. First operand has 294 states, 184 states have (on average 4.043478260869565) internal successors, (744), 293 states have internal predecessors, (744), 0 states have call successors, (0), 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 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-13 21:49:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:44,090 INFO L93 Difference]: Finished difference Result 220 states and 553 transitions. [2021-10-13 21:49:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:49:44,092 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-13 21:49:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:44,107 INFO L225 Difference]: With dead ends: 220 [2021-10-13 21:49:44,107 INFO L226 Difference]: Without dead ends: 220 [2021-10-13 21:49:44,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 21:49:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-13 21:49:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-10-13 21:49:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 145 states have (on average 3.8137931034482757) internal successors, (553), 219 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-13 21:49:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 553 transitions. [2021-10-13 21:49:44,170 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 553 transitions. Word has length 2 [2021-10-13 21:49:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:44,171 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 553 transitions. [2021-10-13 21:49:44,171 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-13 21:49:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 553 transitions. [2021-10-13 21:49:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 21:49:44,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:44,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 21:49:44,189 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-13 21:49:44,387 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-13 21:49:44,388 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:44,390 INFO L82 PathProgramCache]: Analyzing trace with hash 25648, now seen corresponding path program 1 times [2021-10-13 21:49:44,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:44,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788375677] [2021-10-13 21:49:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:44,392 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:44,394 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-13 21:49:44,421 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-13 21:49:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:44,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 21:49:44,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:44,490 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-13 21:49:44,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:44,503 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-13 21:49:44,503 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:44,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788375677] [2021-10-13 21:49:44,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788375677] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:44,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:44,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 21:49:44,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870253344] [2021-10-13 21:49:44,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:49:44,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:49:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:44,507 INFO L87 Difference]: Start difference. First operand 220 states and 553 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-13 21:49:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:44,594 INFO L93 Difference]: Finished difference Result 222 states and 555 transitions. [2021-10-13 21:49:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:49:44,596 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-13 21:49:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:44,599 INFO L225 Difference]: With dead ends: 222 [2021-10-13 21:49:44,599 INFO L226 Difference]: Without dead ends: 222 [2021-10-13 21:49:44,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-13 21:49:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2021-10-13 21:49:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 146 states have (on average 3.8013698630136985) internal successors, (555), 220 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-13 21:49:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 555 transitions. [2021-10-13 21:49:44,623 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 555 transitions. Word has length 2 [2021-10-13 21:49:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:44,623 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 555 transitions. [2021-10-13 21:49:44,623 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-13 21:49:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 555 transitions. [2021-10-13 21:49:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 21:49:44,624 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:44,624 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 21:49:44,647 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-13 21:49:44,847 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-13 21:49:44,848 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash 25500, now seen corresponding path program 1 times [2021-10-13 21:49:44,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:44,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056376481] [2021-10-13 21:49:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:44,851 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:44,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:44,853 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-13 21:49:44,854 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-13 21:49:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:44,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 21:49:44,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:45,247 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:49:45,248 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 27 treesize of output 65 [2021-10-13 21:49:45,319 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-13 21:49:45,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:45,413 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-13 21:49:45,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:45,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056376481] [2021-10-13 21:49:45,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056376481] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:45,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:45,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 21:49:45,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130160803] [2021-10-13 21:49:45,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:49:45,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:45,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:49:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:45,417 INFO L87 Difference]: Start difference. First operand 221 states and 555 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-13 21:49:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:45,876 INFO L93 Difference]: Finished difference Result 221 states and 554 transitions. [2021-10-13 21:49:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:49:45,877 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-13 21:49:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:45,880 INFO L225 Difference]: With dead ends: 221 [2021-10-13 21:49:45,881 INFO L226 Difference]: Without dead ends: 221 [2021-10-13 21:49:45,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-13 21:49:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-10-13 21:49:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 146 states have (on average 3.7945205479452055) internal successors, (554), 220 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-13 21:49:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 554 transitions. [2021-10-13 21:49:45,897 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 554 transitions. Word has length 2 [2021-10-13 21:49:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:45,898 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 554 transitions. [2021-10-13 21:49:45,898 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-13 21:49:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 554 transitions. [2021-10-13 21:49:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 21:49:45,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:45,899 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 21:49:45,913 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-13 21:49:46,111 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-13 21:49:46,112 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash 794572, now seen corresponding path program 1 times [2021-10-13 21:49:46,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:46,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092721762] [2021-10-13 21:49:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:46,116 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:46,120 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-13 21:49:46,121 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-13 21:49:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:46,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 21:49:46,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:46,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:46,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:46,414 INFO L354 Elim1Store]: treesize reduction 147, result has 23.8 percent of original size [2021-10-13 21:49:46,414 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 41 treesize of output 73 [2021-10-13 21:49:46,424 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 121 treesize of output 117 [2021-10-13 21:49:48,171 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-13 21:49:48,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:48,383 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-13 21:49:48,384 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:48,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092721762] [2021-10-13 21:49:48,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092721762] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:49:48,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:49:48,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2021-10-13 21:49:48,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544836923] [2021-10-13 21:49:48,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 21:49:48,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:48,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 21:49:48,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:49:48,386 INFO L87 Difference]: Start difference. First operand 221 states and 554 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:49,284 INFO L93 Difference]: Finished difference Result 403 states and 993 transitions. [2021-10-13 21:49:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 21:49:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 3 [2021-10-13 21:49:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:49,291 INFO L225 Difference]: With dead ends: 403 [2021-10-13 21:49:49,291 INFO L226 Difference]: Without dead ends: 403 [2021-10-13 21:49:49,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 335.9ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-13 21:49:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-10-13 21:49:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 275. [2021-10-13 21:49:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 200 states have (on average 3.785) internal successors, (757), 274 states have internal predecessors, (757), 0 states have call successors, (0), 0 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-13 21:49:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 757 transitions. [2021-10-13 21:49:49,313 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 757 transitions. Word has length 3 [2021-10-13 21:49:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:49,314 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 757 transitions. [2021-10-13 21:49:49,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 757 transitions. [2021-10-13 21:49:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 21:49:49,314 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:49,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 21:49:49,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-13 21:49:49,540 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-13 21:49:49,541 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 794573, now seen corresponding path program 1 times [2021-10-13 21:49:49,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:49,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099764360] [2021-10-13 21:49:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:49,544 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:49,545 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-13 21:49:49,546 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-13 21:49:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:49,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 21:49:49,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:49,781 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-13 21:49:49,782 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 66 treesize of output 101 [2021-10-13 21:49:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:52,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:52,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:52,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099764360] [2021-10-13 21:49:52,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099764360] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:52,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:52,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 21:49:52,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89435567] [2021-10-13 21:49:52,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:49:52,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:49:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:52,172 INFO L87 Difference]: Start difference. First operand 275 states and 757 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:52,369 INFO L93 Difference]: Finished difference Result 234 states and 593 transitions. [2021-10-13 21:49:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:49:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 3 [2021-10-13 21:49:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:52,374 INFO L225 Difference]: With dead ends: 234 [2021-10-13 21:49:52,374 INFO L226 Difference]: Without dead ends: 234 [2021-10-13 21:49:52,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-10-13 21:49:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-10-13 21:49:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 3.331460674157303) internal successors, (593), 233 states have internal predecessors, (593), 0 states have call successors, (0), 0 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-13 21:49:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 593 transitions. [2021-10-13 21:49:52,387 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 593 transitions. Word has length 3 [2021-10-13 21:49:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:52,387 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 593 transitions. [2021-10-13 21:49:52,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 593 transitions. [2021-10-13 21:49:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 21:49:52,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:52,388 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 21:49:52,405 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-13 21:49:52,605 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-13 21:49:52,606 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 794424, now seen corresponding path program 1 times [2021-10-13 21:49:52,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:52,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948755858] [2021-10-13 21:49:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:52,608 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:52,609 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-13 21:49:52,610 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-13 21:49:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:52,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 21:49:52,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:52,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:52,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:52,891 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:49:52,892 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-13 21:49:53,027 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-13 21:49:53,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:53,267 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-13 21:49:53,267 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:53,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948755858] [2021-10-13 21:49:53,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948755858] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:49:53,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:49:53,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2021-10-13 21:49:53,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17828441] [2021-10-13 21:49:53,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 21:49:53,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 21:49:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:49:53,270 INFO L87 Difference]: Start difference. First operand 234 states and 593 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:54,026 INFO L93 Difference]: Finished difference Result 318 states and 746 transitions. [2021-10-13 21:49:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 21:49:54,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 3 [2021-10-13 21:49:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:54,031 INFO L225 Difference]: With dead ends: 318 [2021-10-13 21:49:54,031 INFO L226 Difference]: Without dead ends: 318 [2021-10-13 21:49:54,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 347.0ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-10-13 21:49:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-10-13 21:49:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 234. [2021-10-13 21:49:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 3.3146067415730336) internal successors, (590), 233 states have internal predecessors, (590), 0 states have call successors, (0), 0 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-13 21:49:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 590 transitions. [2021-10-13 21:49:54,042 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 590 transitions. Word has length 3 [2021-10-13 21:49:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:54,042 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 590 transitions. [2021-10-13 21:49:54,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 590 transitions. [2021-10-13 21:49:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 21:49:54,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:54,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 21:49:54,055 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-13 21:49:54,255 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-13 21:49:54,256 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash 763600219, now seen corresponding path program 1 times [2021-10-13 21:49:54,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:54,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418290874] [2021-10-13 21:49:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:54,258 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:54,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:54,260 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-13 21:49:54,263 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-13 21:49:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:54,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 21:49:54,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:54,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:54,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:49:54,559 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:49:54,559 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-13 21:49:54,838 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-13 21:49:54,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:55,129 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-13 21:49:55,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:55,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418290874] [2021-10-13 21:49:55,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418290874] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:49:55,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:49:55,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 21:49:55,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335315698] [2021-10-13 21:49:55,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 21:49:55,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 21:49:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:49:55,132 INFO L87 Difference]: Start difference. First operand 234 states and 590 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-13 21:49:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:55,670 INFO L93 Difference]: Finished difference Result 292 states and 694 transitions. [2021-10-13 21:49:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 21:49:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 5 [2021-10-13 21:49:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:55,677 INFO L225 Difference]: With dead ends: 292 [2021-10-13 21:49:55,677 INFO L226 Difference]: Without dead ends: 292 [2021-10-13 21:49:55,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 312.9ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-10-13 21:49:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-10-13 21:49:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 221. [2021-10-13 21:49:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 174 states have (on average 3.2126436781609193) internal successors, (559), 220 states have internal predecessors, (559), 0 states have call successors, (0), 0 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-13 21:49:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 559 transitions. [2021-10-13 21:49:55,688 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 559 transitions. Word has length 5 [2021-10-13 21:49:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:55,689 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 559 transitions. [2021-10-13 21:49:55,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-13 21:49:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 559 transitions. [2021-10-13 21:49:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 21:49:55,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:55,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 21:49:55,702 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-13 21:49:55,900 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-13 21:49:55,901 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 763600220, now seen corresponding path program 1 times [2021-10-13 21:49:55,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:55,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293349546] [2021-10-13 21:49:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:55,903 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:55,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:55,905 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-13 21:49:55,907 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-13 21:49:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:55,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 21:49:55,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:56,132 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-13 21:49:56,133 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-13 21:49:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:56,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:56,494 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:56,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293349546] [2021-10-13 21:49:56,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293349546] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:56,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:56,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2021-10-13 21:49:56,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402059821] [2021-10-13 21:49:56,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 21:49:56,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 21:49:56,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 21:49:56,496 INFO L87 Difference]: Start difference. First operand 221 states and 559 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-13 21:49:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:56,632 INFO L93 Difference]: Finished difference Result 208 states and 528 transitions. [2021-10-13 21:49:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:49:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-13 21:49:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:56,636 INFO L225 Difference]: With dead ends: 208 [2021-10-13 21:49:56,636 INFO L226 Difference]: Without dead ends: 208 [2021-10-13 21:49:56,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 21:49:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-13 21:49:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-10-13 21:49:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 170 states have (on average 3.1058823529411765) internal successors, (528), 207 states have internal predecessors, (528), 0 states have call successors, (0), 0 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-13 21:49:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 528 transitions. [2021-10-13 21:49:56,645 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 528 transitions. Word has length 5 [2021-10-13 21:49:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:56,645 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 528 transitions. [2021-10-13 21:49:56,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 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-13 21:49:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 528 transitions. [2021-10-13 21:49:56,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 21:49:56,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:56,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 21:49:56,659 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-13 21:49:56,858 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-13 21:49:56,859 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2098204321, now seen corresponding path program 1 times [2021-10-13 21:49:56,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:56,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384569619] [2021-10-13 21:49:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:56,862 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:56,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:56,863 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-13 21:49:56,866 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-13 21:49:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:56,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 21:49:56,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:57,051 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-13 21:49:57,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:57,258 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 35 treesize of output 31 [2021-10-13 21:49:57,393 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-13 21:49:57,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:57,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384569619] [2021-10-13 21:49:57,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384569619] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:49:57,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:49:57,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 21:49:57,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148911273] [2021-10-13 21:49:57,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 21:49:57,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:57,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 21:49:57,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:49:57,395 INFO L87 Difference]: Start difference. First operand 208 states and 528 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-13 21:49:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:58,215 INFO L93 Difference]: Finished difference Result 384 states and 948 transitions. [2021-10-13 21:49:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 21:49:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 [2021-10-13 21:49:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:58,220 INFO L225 Difference]: With dead ends: 384 [2021-10-13 21:49:58,220 INFO L226 Difference]: Without dead ends: 384 [2021-10-13 21:49:58,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 366.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-10-13 21:49:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-10-13 21:49:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 244. [2021-10-13 21:49:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 206 states have (on average 3.378640776699029) internal successors, (696), 243 states have internal predecessors, (696), 0 states have call successors, (0), 0 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-13 21:49:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 696 transitions. [2021-10-13 21:49:58,231 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 696 transitions. Word has length 6 [2021-10-13 21:49:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:58,232 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 696 transitions. [2021-10-13 21:49:58,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-13 21:49:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 696 transitions. [2021-10-13 21:49:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 21:49:58,233 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:58,233 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 21:49:58,247 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-13 21:49:58,445 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-13 21:49:58,446 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2098204319, now seen corresponding path program 1 times [2021-10-13 21:49:58,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:58,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560499727] [2021-10-13 21:49:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:49:58,448 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:58,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:58,449 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-13 21:49:58,452 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-13 21:49:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:49:58,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 21:49:58,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:58,697 INFO L354 Elim1Store]: treesize reduction 232, result has 18.9 percent of original size [2021-10-13 21:49:58,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, 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-13 21:49:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:49:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:49:59,136 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:49:59,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560499727] [2021-10-13 21:49:59,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560499727] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:49:59,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:49:59,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 21:49:59,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385383478] [2021-10-13 21:49:59,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:49:59,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:49:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:49:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:49:59,139 INFO L87 Difference]: Start difference. First operand 244 states and 696 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:49:59,332 INFO L93 Difference]: Finished difference Result 186 states and 501 transitions. [2021-10-13 21:49:59,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:49:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-13 21:49:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:49:59,335 INFO L225 Difference]: With dead ends: 186 [2021-10-13 21:49:59,335 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 21:49:59,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 21:49:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 21:49:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-10-13 21:49:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 164 states have (on average 3.0548780487804876) internal successors, (501), 185 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-13 21:49:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 501 transitions. [2021-10-13 21:49:59,343 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 501 transitions. Word has length 6 [2021-10-13 21:49:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:49:59,344 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 501 transitions. [2021-10-13 21:49:59,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:49:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 501 transitions. [2021-10-13 21:49:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 21:49:59,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:49:59,345 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1] [2021-10-13 21:49:59,359 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-13 21:49:59,559 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-13 21:49:59,560 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:49:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:49:59,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2099221712, now seen corresponding path program 2 times [2021-10-13 21:49:59,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:49:59,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45374645] [2021-10-13 21:49:59,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 21:49:59,562 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:49:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:49:59,564 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-13 21:49:59,571 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-13 21:49:59,652 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 21:49:59,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:49:59,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 21:49:59,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:49:59,807 INFO L354 Elim1Store]: treesize reduction 147, result has 23.8 percent of original size [2021-10-13 21:49:59,808 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 48 treesize of output 80 [2021-10-13 21:49:59,818 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 180 treesize of output 178 [2021-10-13 21:50:01,305 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-13 21:50:01,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:01,401 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-13 21:50:01,401 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:01,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45374645] [2021-10-13 21:50:01,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45374645] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:50:01,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:50:01,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 21:50:01,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119413621] [2021-10-13 21:50:01,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:50:01,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:01,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:50:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:50:01,404 INFO L87 Difference]: Start difference. First operand 186 states and 501 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:50:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:01,631 INFO L93 Difference]: Finished difference Result 150 states and 388 transitions. [2021-10-13 21:50:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:50:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-10-13 21:50:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:01,634 INFO L225 Difference]: With dead ends: 150 [2021-10-13 21:50:01,634 INFO L226 Difference]: Without dead ends: 150 [2021-10-13 21:50:01,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:50:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-13 21:50:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 104. [2021-10-13 21:50:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 2.7204301075268815) internal successors, (253), 103 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-13 21:50:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 253 transitions. [2021-10-13 21:50:01,639 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 253 transitions. Word has length 6 [2021-10-13 21:50:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:01,640 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 253 transitions. [2021-10-13 21:50:01,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-13 21:50:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 253 transitions. [2021-10-13 21:50:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 21:50:01,641 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:01,641 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1] [2021-10-13 21:50:01,655 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-13 21:50:01,853 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-13 21:50:01,853 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2099221860, now seen corresponding path program 2 times [2021-10-13 21:50:01,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:01,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4340478] [2021-10-13 21:50:01,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 21:50:01,856 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:01,857 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-13 21:50:01,862 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-13 21:50:01,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 21:50:01,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:01,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 21:50:01,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:01,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:01,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:02,133 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:50:02,134 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-13 21:50:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 21:50:02,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 21:50:03,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:03,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4340478] [2021-10-13 21:50:03,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4340478] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:50:03,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:50:03,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-10-13 21:50:03,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887046862] [2021-10-13 21:50:03,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 21:50:03,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 21:50:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-10-13 21:50:03,396 INFO L87 Difference]: Start difference. First operand 104 states and 253 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-13 21:50:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:08,025 INFO L93 Difference]: Finished difference Result 886 states and 2201 transitions. [2021-10-13 21:50:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 21:50:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 [2021-10-13 21:50:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:08,034 INFO L225 Difference]: With dead ends: 886 [2021-10-13 21:50:08,034 INFO L226 Difference]: Without dead ends: 886 [2021-10-13 21:50:08,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2449.5ms TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2021-10-13 21:50:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-10-13 21:50:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 110. [2021-10-13 21:50:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 2.676767676767677) internal successors, (265), 109 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-13 21:50:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 265 transitions. [2021-10-13 21:50:08,049 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 265 transitions. Word has length 6 [2021-10-13 21:50:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:08,050 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 265 transitions. [2021-10-13 21:50:08,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-13 21:50:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 265 transitions. [2021-10-13 21:50:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 21:50:08,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:08,052 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:08,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:08,264 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-13 21:50:08,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash -619823723, now seen corresponding path program 1 times [2021-10-13 21:50:08,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:08,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167141013] [2021-10-13 21:50:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:50:08,267 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:08,269 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-13 21:50:08,270 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-13 21:50:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:50:08,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 21:50:08,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:08,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:08,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:08,593 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:50:08,593 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-13 21:50:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:08,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:09,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:09,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167141013] [2021-10-13 21:50:09,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167141013] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:50:09,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:50:09,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2021-10-13 21:50:09,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738247486] [2021-10-13 21:50:09,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 21:50:09,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 21:50:09,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:50:09,628 INFO L87 Difference]: Start difference. First operand 110 states and 265 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 21:50:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:12,132 INFO L93 Difference]: Finished difference Result 192 states and 463 transitions. [2021-10-13 21:50:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 21:50:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 21:50:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:12,136 INFO L225 Difference]: With dead ends: 192 [2021-10-13 21:50:12,137 INFO L226 Difference]: Without dead ends: 192 [2021-10-13 21:50:12,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1481.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 21:50:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-13 21:50:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2021-10-13 21:50:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 2.634920634920635) internal successors, (332), 136 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-13 21:50:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 332 transitions. [2021-10-13 21:50:12,143 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 332 transitions. Word has length 7 [2021-10-13 21:50:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:12,143 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 332 transitions. [2021-10-13 21:50:12,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 21:50:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 332 transitions. [2021-10-13 21:50:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 21:50:12,144 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:12,145 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:12,157 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-13 21:50:12,357 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-13 21:50:12,357 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -96061703, now seen corresponding path program 2 times [2021-10-13 21:50:12,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:12,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947198137] [2021-10-13 21:50:12,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 21:50:12,360 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:12,361 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-13 21:50:12,362 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-13 21:50:12,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-13 21:50:12,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:12,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 21:50:12,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:12,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:12,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:12,642 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:50:12,642 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-13 21:50:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 21:50:12,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 21:50:13,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:13,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947198137] [2021-10-13 21:50:13,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947198137] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:50:13,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:50:13,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 4 [2021-10-13 21:50:13,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699712300] [2021-10-13 21:50:13,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 21:50:13,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:13,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 21:50:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:50:13,977 INFO L87 Difference]: Start difference. First operand 137 states and 332 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-13 21:50:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:14,183 INFO L93 Difference]: Finished difference Result 81 states and 189 transitions. [2021-10-13 21:50:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:50:14,184 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 10 [2021-10-13 21:50:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:14,185 INFO L225 Difference]: With dead ends: 81 [2021-10-13 21:50:14,185 INFO L226 Difference]: Without dead ends: 81 [2021-10-13 21:50:14,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 235.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 21:50:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-13 21:50:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 46. [2021-10-13 21:50:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-13 21:50:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 95 transitions. [2021-10-13 21:50:14,188 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 95 transitions. Word has length 10 [2021-10-13 21:50:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:14,188 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 95 transitions. [2021-10-13 21:50:14,188 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-13 21:50:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 95 transitions. [2021-10-13 21:50:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 21:50:14,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:14,189 INFO L512 BasicCegarLoop]: trace histogram [10, 1, 1] [2021-10-13 21:50:14,200 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-13 21:50:14,391 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-13 21:50:14,392 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1928389916, now seen corresponding path program 3 times [2021-10-13 21:50:14,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:14,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112147615] [2021-10-13 21:50:14,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 21:50:14,395 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:14,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:14,396 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-13 21:50:14,400 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-13 21:50:14,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-13 21:50:14,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:14,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 21:50:14,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:14,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:14,803 INFO L354 Elim1Store]: treesize reduction 141, result has 26.9 percent of original size [2021-10-13 21:50:14,804 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-13 21:50:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 21:50:15,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 21:50:19,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:19,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112147615] [2021-10-13 21:50:19,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112147615] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:50:19,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:50:19,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2021-10-13 21:50:19,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163010600] [2021-10-13 21:50:19,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-13 21:50:19,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-13 21:50:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-10-13 21:50:19,464 INFO L87 Difference]: Start difference. First operand 46 states and 95 transitions. Second operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-13 21:50:27,293 WARN L207 SmtUtils]: Spent 5.96 s on a formula simplification that was a NOOP. DAG size: 135 [2021-10-13 21:50:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:48,984 INFO L93 Difference]: Finished difference Result 718 states and 1559 transitions. [2021-10-13 21:50:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-13 21:50:48,986 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 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 12 [2021-10-13 21:50:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:48,991 INFO L225 Difference]: With dead ends: 718 [2021-10-13 21:50:48,991 INFO L226 Difference]: Without dead ends: 718 [2021-10-13 21:50:48,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 27693.5ms TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 21:50:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-10-13 21:50:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 58. [2021-10-13 21:50:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 2.125) internal successors, (119), 57 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-13 21:50:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 119 transitions. [2021-10-13 21:50:49,000 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 119 transitions. Word has length 12 [2021-10-13 21:50:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:49,001 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 119 transitions. [2021-10-13 21:50:49,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-13 21:50:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 119 transitions. [2021-10-13 21:50:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 21:50:49,002 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:49,002 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:49,015 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-13 21:50:49,202 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-13 21:50:49,203 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -530899752, now seen corresponding path program 1 times [2021-10-13 21:50:49,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:49,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692094511] [2021-10-13 21:50:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:50:49,205 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:49,207 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-13 21:50:49,208 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-13 21:50:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:50:49,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 21:50:49,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:49,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:49,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:49,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692094511] [2021-10-13 21:50:49,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692094511] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:50:49,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:50:49,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2021-10-13 21:50:49,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579573548] [2021-10-13 21:50:49,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:50:49,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:49,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:50:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:50:49,513 INFO L87 Difference]: Start difference. First operand 58 states and 119 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-13 21:50:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:49,554 INFO L93 Difference]: Finished difference Result 85 states and 180 transitions. [2021-10-13 21:50:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 21:50:49,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 15 [2021-10-13 21:50:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:49,555 INFO L225 Difference]: With dead ends: 85 [2021-10-13 21:50:49,556 INFO L226 Difference]: Without dead ends: 80 [2021-10-13 21:50:49,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 21:50:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-10-13 21:50:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-10-13 21:50:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 2.1794871794871793) internal successors, (170), 79 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-13 21:50:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 170 transitions. [2021-10-13 21:50:49,560 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 170 transitions. Word has length 15 [2021-10-13 21:50:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:49,560 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 170 transitions. [2021-10-13 21:50:49,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-13 21:50:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 170 transitions. [2021-10-13 21:50:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 21:50:49,561 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:49,562 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:49,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-10-13 21:50:49,774 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-13 21:50:49,774 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash -370080423, now seen corresponding path program 1 times [2021-10-13 21:50:49,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:49,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507410658] [2021-10-13 21:50:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:50:49,776 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:49,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:49,778 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-13 21:50:49,779 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-13 21:50:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:50:49,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 21:50:49,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:50,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:50,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:50,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507410658] [2021-10-13 21:50:50,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507410658] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:50:50,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:50:50,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-10-13 21:50:50,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144193758] [2021-10-13 21:50:50,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 21:50:50,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 21:50:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 21:50:50,080 INFO L87 Difference]: Start difference. First operand 80 states and 170 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-13 21:50:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:50,261 INFO L93 Difference]: Finished difference Result 118 states and 240 transitions. [2021-10-13 21:50:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 21:50:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 21:50:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:50,266 INFO L225 Difference]: With dead ends: 118 [2021-10-13 21:50:50,266 INFO L226 Difference]: Without dead ends: 108 [2021-10-13 21:50:50,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 21:50:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-10-13 21:50:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2021-10-13 21:50:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 2.2674418604651163) internal successors, (195), 87 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-13 21:50:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 195 transitions. [2021-10-13 21:50:50,272 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 195 transitions. Word has length 16 [2021-10-13 21:50:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:50,273 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 195 transitions. [2021-10-13 21:50:50,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-13 21:50:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 195 transitions. [2021-10-13 21:50:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 21:50:50,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:50,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:50,293 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-13 21:50:50,493 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-13 21:50:50,494 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 521153890, now seen corresponding path program 1 times [2021-10-13 21:50:50,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:50,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958152659] [2021-10-13 21:50:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:50:50,497 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:50,498 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-13 21:50:50,499 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-13 21:50:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:50:50,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 21:50:50,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:50,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:50,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:50,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958152659] [2021-10-13 21:50:50,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958152659] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 21:50:50,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 21:50:50,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-10-13 21:50:50,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142840516] [2021-10-13 21:50:50,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 21:50:50,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 21:50:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:50:50,855 INFO L87 Difference]: Start difference. First operand 88 states and 195 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 21:50:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:51,193 INFO L93 Difference]: Finished difference Result 112 states and 241 transitions. [2021-10-13 21:50:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 21:50:51,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 21:50:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:51,194 INFO L225 Difference]: With dead ends: 112 [2021-10-13 21:50:51,194 INFO L226 Difference]: Without dead ends: 112 [2021-10-13 21:50:51,195 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:50:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-13 21:50:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2021-10-13 21:50:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 2.26) internal successors, (226), 101 states have internal predecessors, (226), 0 states have call successors, (0), 0 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-13 21:50:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 226 transitions. [2021-10-13 21:50:51,201 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 226 transitions. Word has length 16 [2021-10-13 21:50:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:51,201 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 226 transitions. [2021-10-13 21:50:51,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 21:50:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 226 transitions. [2021-10-13 21:50:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 21:50:51,202 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:51,202 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:51,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:51,415 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-13 21:50:51,416 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash 550417497, now seen corresponding path program 2 times [2021-10-13 21:50:51,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:51,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442326857] [2021-10-13 21:50:51,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 21:50:51,418 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:51,419 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 21:50:51,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 21:50:51,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 21:50:51,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:51,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 21:50:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:51,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:51,813 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:51,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442326857] [2021-10-13 21:50:51,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442326857] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 21:50:51,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 21:50:51,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-10-13 21:50:51,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6271867] [2021-10-13 21:50:51,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:50:51,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:50:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:50:51,816 INFO L87 Difference]: Start difference. First operand 102 states and 226 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-13 21:50:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:51,997 INFO L93 Difference]: Finished difference Result 106 states and 235 transitions. [2021-10-13 21:50:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:50:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 16 [2021-10-13 21:50:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:51,999 INFO L225 Difference]: With dead ends: 106 [2021-10-13 21:50:51,999 INFO L226 Difference]: Without dead ends: 106 [2021-10-13 21:50:51,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.2ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 21:50:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-10-13 21:50:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2021-10-13 21:50:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 2.215909090909091) internal successors, (195), 89 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-13 21:50:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 195 transitions. [2021-10-13 21:50:52,004 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 195 transitions. Word has length 16 [2021-10-13 21:50:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:52,005 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 195 transitions. [2021-10-13 21:50:52,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-13 21:50:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 195 transitions. [2021-10-13 21:50:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 21:50:52,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:52,006 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:52,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:52,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 21:50:52,218 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1835003736, now seen corresponding path program 2 times [2021-10-13 21:50:52,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:52,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287307042] [2021-10-13 21:50:52,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 21:50:52,220 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:52,222 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 21:50:52,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-10-13 21:50:52,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 21:50:52,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:52,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 21:50:52,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 21:50:52,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 21:50:52,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:52,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287307042] [2021-10-13 21:50:52,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287307042] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 21:50:52,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 21:50:52,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2021-10-13 21:50:52,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672976638] [2021-10-13 21:50:52,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:50:52,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:50:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-13 21:50:52,748 INFO L87 Difference]: Start difference. First operand 90 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-13 21:50:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:52,913 INFO L93 Difference]: Finished difference Result 110 states and 244 transitions. [2021-10-13 21:50:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:50:52,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 19 [2021-10-13 21:50:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:52,915 INFO L225 Difference]: With dead ends: 110 [2021-10-13 21:50:52,915 INFO L226 Difference]: Without dead ends: 110 [2021-10-13 21:50:52,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-13 21:50:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-13 21:50:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2021-10-13 21:50:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 2.24) internal successors, (224), 101 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-13 21:50:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 224 transitions. [2021-10-13 21:50:52,920 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 224 transitions. Word has length 19 [2021-10-13 21:50:52,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:52,920 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 224 transitions. [2021-10-13 21:50:52,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-13 21:50:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 224 transitions. [2021-10-13 21:50:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 21:50:52,921 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:52,921 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:52,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:53,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 21:50:53,126 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash 165590048, now seen corresponding path program 3 times [2021-10-13 21:50:53,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:53,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161415795] [2021-10-13 21:50:53,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 21:50:53,128 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:53,129 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 21:50:53,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-10-13 21:50:53,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-13 21:50:53,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:53,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 21:50:53,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 21:50:53,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 21:50:53,512 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:53,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161415795] [2021-10-13 21:50:53,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161415795] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 21:50:53,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 21:50:53,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-10-13 21:50:53,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964817608] [2021-10-13 21:50:53,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 21:50:53,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 21:50:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:50:53,514 INFO L87 Difference]: Start difference. First operand 102 states and 224 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-13 21:50:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:53,642 INFO L93 Difference]: Finished difference Result 146 states and 316 transitions. [2021-10-13 21:50:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:50:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 19 [2021-10-13 21:50:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:53,648 INFO L225 Difference]: With dead ends: 146 [2021-10-13 21:50:53,648 INFO L226 Difference]: Without dead ends: 146 [2021-10-13 21:50:53,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:50:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-13 21:50:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 106. [2021-10-13 21:50:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 2.2884615384615383) internal successors, (238), 105 states have internal predecessors, (238), 0 states have call successors, (0), 0 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-13 21:50:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2021-10-13 21:50:53,653 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 19 [2021-10-13 21:50:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:53,653 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2021-10-13 21:50:53,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-13 21:50:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2021-10-13 21:50:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 21:50:53,654 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:53,654 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:53,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:53,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 21:50:53,871 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:53,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash -280867302, now seen corresponding path program 4 times [2021-10-13 21:50:53,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:53,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910569942] [2021-10-13 21:50:53,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 21:50:53,873 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:53,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:53,875 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 21:50:53,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 21:50:54,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 21:50:54,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 21:50:54,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 21:50:54,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 21:50:54,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:50:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 21:50:54,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 21:50:54,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910569942] [2021-10-13 21:50:54,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910569942] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 21:50:54,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 21:50:54,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-10-13 21:50:54,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612686310] [2021-10-13 21:50:54,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 21:50:54,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 21:50:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 21:50:54,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 21:50:54,240 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 21:50:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 21:50:54,392 INFO L93 Difference]: Finished difference Result 110 states and 242 transitions. [2021-10-13 21:50:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 21:50:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-13 21:50:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 21:50:54,394 INFO L225 Difference]: With dead ends: 110 [2021-10-13 21:50:54,394 INFO L226 Difference]: Without dead ends: 106 [2021-10-13 21:50:54,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 21:50:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-10-13 21:50:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-10-13 21:50:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 2.25) internal successors, (234), 105 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-13 21:50:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 234 transitions. [2021-10-13 21:50:54,399 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 234 transitions. Word has length 19 [2021-10-13 21:50:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 21:50:54,399 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 234 transitions. [2021-10-13 21:50:54,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 21:50:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 234 transitions. [2021-10-13 21:50:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 21:50:54,400 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 21:50:54,401 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 21:50:54,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-10-13 21:50:54,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 21:50:54,613 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATION, thread1Err1REQUIRES_VIOLATION, thread2Err0REQUIRES_VIOLATION, thread2Err1REQUIRES_VIOLATION (and 30 more)] === [2021-10-13 21:50:54,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 21:50:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash -41516327, now seen corresponding path program 1 times [2021-10-13 21:50:54,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 21:50:54,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376655074] [2021-10-13 21:50:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 21:50:54,615 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 21:50:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat [2021-10-13 21:50:54,617 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 21:50:54,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-13 21:50:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 21:50:54,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 27 conjunts are in the unsatisfiable core [2021-10-13 21:50:54,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 21:50:55,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 21:50:55,600 INFO L354 Elim1Store]: treesize reduction 504, result has 4.7 percent of original size [2021-10-13 21:50:55,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 66 case distinctions, treesize of input 719 treesize of output 162 [2021-10-13 21:50:56,186 INFO L354 Elim1Store]: treesize reduction 876, result has 4.1 percent of original size [2021-10-13 21:50:56,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 28 new quantified variables, introduced 120 case distinctions, treesize of input 2218 treesize of output 214 [2021-10-13 21:50:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 21:50:56,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 21:51:01,879 WARN L207 SmtUtils]: Spent 5.49 s on a formula simplification. DAG size of input: 520 DAG size of output: 136 [2021-10-13 21:51:01,880 INFO L354 Elim1Store]: treesize reduction 996, result has 20.1 percent of original size [2021-10-13 21:51:01,881 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 28 new quantified variables, introduced 120 case distinctions, treesize of input 3579 treesize of output 456 Received shutdown request... [2021-10-13 22:03:05,857 WARN L223 SmtUtils]: Removed 1 from assertion stack [2021-10-13 22:03:05,859 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 22:03:05,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-10-13 22:03:05,887 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-10-13 22:03:05,887 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-13 22:03:06,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-10-13 22:03:06,061 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. [2021-10-13 22:03:06,064 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-13 22:03:06,064 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-13 22:03:06,064 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-13 22:03:06,064 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-13 22:03:06,064 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 22:03:06,065 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 22:03:06,066 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 22:03:06,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4REQUIRES_VIOLATION [2021-10-13 22:03:06,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5REQUIRES_VIOLATION [2021-10-13 22:03:06,069 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6REQUIRES_VIOLATION [2021-10-13 22:03:06,069 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7REQUIRES_VIOLATION [2021-10-13 22:03:06,076 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 22:03:06,076 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 22:03:06,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:03:06 BasicIcfg [2021-10-13 22:03:06,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 22:03:06,079 INFO L168 Benchmark]: Toolchain (without parser) took 842382.37 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.0 MB in the beginning and 140.9 MB in the end (delta: -14.9 MB). Peak memory consumption was 117.0 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,080 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 214.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-13 22:03:06,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 112.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.78 ms. Allocated memory is still 151.0 MB. Free memory was 112.6 MB in the beginning and 110.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,081 INFO L168 Benchmark]: Boogie Preprocessor took 39.76 ms. Allocated memory is still 151.0 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,081 INFO L168 Benchmark]: RCFGBuilder took 886.74 ms. Allocated memory is still 151.0 MB. Free memory was 108.8 MB in the beginning and 127.2 MB in the end (delta: -18.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,081 INFO L168 Benchmark]: TraceAbstraction took 840976.73 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.7 MB in the beginning and 140.9 MB in the end (delta: -14.2 MB). Peak memory consumption was 117.0 MB. Max. memory is 8.0 GB. [2021-10-13 22:03:06,084 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.24 ms. Allocated memory is still 151.0 MB. Free memory was 122.3 MB in the beginning and 122.0 MB in the end (delta: 214.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 412.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 112.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 51.78 ms. Allocated memory is still 151.0 MB. Free memory was 112.6 MB in the beginning and 110.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.76 ms. Allocated memory is still 151.0 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 886.74 ms. Allocated memory is still 151.0 MB. Free memory was 108.8 MB in the beginning and 127.2 MB in the end (delta: -18.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 840976.73 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 126.7 MB in the beginning and 140.9 MB in the end (delta: -14.2 MB). Peak memory consumption was 117.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: 37346.9ms, 186 PlacesBefore, 45 PlacesAfterwards, 195 TransitionsBefore, 41 TransitionsAfterwards, 4240 CoEnabledTransitionPairs, 7 FixpointIterations, 86 TrivialSequentialCompositions, 110 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 4 ConcurrentYvCompositions, 13 ChoiceCompositions, 229 TotalNumberOfCompositions, 4487 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4412, positive: 4393, positive conditional: 0, positive unconditional: 4393, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2493, positive: 2485, positive conditional: 0, positive unconditional: 2485, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2493, positive: 2485, positive conditional: 0, positive unconditional: 2485, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 850, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 850, negative conditional: 0, negative unconditional: 850, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4412, positive: 1908, positive conditional: 0, positive unconditional: 1908, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2493, unknown conditional: 0, unknown unconditional: 2493] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, 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 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed Cancelled while BasicCegarLoop was analyzing trace of length 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - 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 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - 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 21 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 257 locations, 34 error locations. Started 1 CEGAR loops. OverallTime: 840721.7ms, OverallIterations: 23, TraceHistogramMax: 10, EmptinessCheckTime: 32.6ms, AutomataDifference: 42787.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37461.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 502 SDtfs, 3588 SDslu, 1639 SDs, 0 SdLazy, 1800 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13623.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 33865.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=0, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 231.2ms AutomataMinimizationTime, 22 MinimizatonAttempts, 2090 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 196.1ms SsaConstructionTime, 1168.5ms SatisfiabilityAnalysisTime, 21071.2ms InterpolantComputationTime, 198 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 352 ConstructedInterpolants, 33 QuantifiedInterpolants, 3853 SizeOfPredicates, 138 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 44 InterpolantComputations, 25 PerfectInterpolantSequences, 113/270 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