/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:13:44,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:13:44,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:13:44,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:13:44,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:13:44,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:13:44,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:13:44,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:13:44,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:13:44,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:13:44,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:13:44,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:13:44,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:13:44,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:13:44,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:13:44,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:13:44,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:13:44,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:13:44,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:13:44,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:13:44,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:13:44,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:13:44,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:13:44,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:13:44,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:13:44,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:13:44,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:13:44,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:13:44,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:13:44,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:13:44,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:13:44,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:13:44,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:13:44,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:13:44,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:13:44,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:13:44,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:13:44,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:13:44,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:13:44,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:13:44,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:13:44,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:13:44,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:13:44,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:13:44,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:13:44,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:13:44,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:13:44,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:13:44,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:13:44,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:13:44,962 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:13:44,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:13:44,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:13:44,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:13:44,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:13:44,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:13:44,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:13:44,965 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:13:44,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:13:44,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:13:44,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:13:44,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:13:44,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:13:44,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:13:44,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:13:44,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:13:44,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:13:44,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 17:13:45,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:13:45,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:13:45,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:13:45,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:13:45,242 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:13:45,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-03 17:13:45,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f8a490/272d7dfc0d5a4d98a81db6f6b0c94f80/FLAG099bd848d [2022-03-03 17:13:45,667 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:13:45,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-03-03 17:13:45,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f8a490/272d7dfc0d5a4d98a81db6f6b0c94f80/FLAG099bd848d [2022-03-03 17:13:46,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f8a490/272d7dfc0d5a4d98a81db6f6b0c94f80 [2022-03-03 17:13:46,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:13:46,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:13:46,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:13:46,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:13:46,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:13:46,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be1a7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46, skipping insertion in model container [2022-03-03 17:13:46,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:13:46,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:13:46,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-03 17:13:46,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:13:46,282 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:13:46,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-03-03 17:13:46,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:13:46,321 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:13:46,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46 WrapperNode [2022-03-03 17:13:46,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:13:46,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:13:46,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:13:46,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:13:46,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,363 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-03-03 17:13:46,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:13:46,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:13:46,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:13:46,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:13:46,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:13:46,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:13:46,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:13:46,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:13:46,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (1/1) ... [2022-03-03 17:13:46,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:13:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:13:46,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-03 17:13:46,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-03 17:13:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:13:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:13:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:13:46,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:13:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:13:46,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:13:46,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:13:46,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:13:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:13:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:13:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-03 17:13:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:13:46,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:13:46,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:13:46,483 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:13:46,568 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:13:46,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:13:46,911 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:13:47,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:13:47,042 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-03 17:13:47,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:13:47 BoogieIcfgContainer [2022-03-03 17:13:47,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:13:47,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:13:47,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:13:47,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:13:47,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:13:46" (1/3) ... [2022-03-03 17:13:47,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb7995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:13:47, skipping insertion in model container [2022-03-03 17:13:47,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:13:46" (2/3) ... [2022-03-03 17:13:47,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efb7995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:13:47, skipping insertion in model container [2022-03-03 17:13:47,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:13:47" (3/3) ... [2022-03-03 17:13:47,057 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-03-03 17:13:47,061 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:13:47,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:13:47,062 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:13:47,062 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:13:47,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,138 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,139 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,146 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,150 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,152 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,154 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,157 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,157 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,163 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,163 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,163 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,164 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,165 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,166 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,199 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,204 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,205 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,205 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,205 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,205 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,205 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,209 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,209 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,210 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,211 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,211 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,211 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,211 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,214 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,215 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,216 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,216 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,218 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,218 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,218 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,218 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,220 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,221 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,222 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:13:47,228 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-03-03 17:13:47,265 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:13:47,271 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:13:47,272 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-03 17:13:47,286 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 204 places, 205 transitions, 454 flow [2022-03-03 17:13:48,242 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-03 17:13:48,582 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:13:48,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:13:48,584 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:13:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:13:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -843314989, now seen corresponding path program 1 times [2022-03-03 17:13:48,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:13:48,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893690004] [2022-03-03 17:13:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:13:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:13:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:13:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:13:48,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:13:48,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893690004] [2022-03-03 17:13:48,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893690004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:13:48,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:13:48,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:13:48,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243911950] [2022-03-03 17:13:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:13:48,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:13:48,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:13:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:13:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:13:49,012 INFO L87 Difference]: Start difference. First operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 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 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:13:49,451 INFO L93 Difference]: Finished difference Result 19453 states and 81672 transitions. [2022-03-03 17:13:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:13:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2022-03-03 17:13:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:13:49,750 INFO L225 Difference]: With dead ends: 19453 [2022-03-03 17:13:49,751 INFO L226 Difference]: Without dead ends: 19449 [2022-03-03 17:13:49,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:13:49,756 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:13:49,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:13:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2022-03-03 17:13:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2022-03-03 17:13:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 4.199300699300699) internal successors, (81668), 19448 states have internal predecessors, (81668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 81668 transitions. [2022-03-03 17:13:51,163 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 81668 transitions. Word has length 145 [2022-03-03 17:13:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:13:51,164 INFO L470 AbstractCegarLoop]: Abstraction has 19449 states and 81668 transitions. [2022-03-03 17:13:51,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 81668 transitions. [2022-03-03 17:13:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:13:51,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:13:51,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:13:51,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:13:51,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:13:51,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:13:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1753742463, now seen corresponding path program 1 times [2022-03-03 17:13:51,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:13:51,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116401490] [2022-03-03 17:13:51,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:13:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:13:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:13:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:13:51,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:13:51,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116401490] [2022-03-03 17:13:51,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116401490] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:13:51,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:13:51,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:13:51,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102806456] [2022-03-03 17:13:51,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:13:51,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:13:51,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:13:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:13:51,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:13:51,556 INFO L87 Difference]: Start difference. First operand 19449 states and 81668 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:13:52,526 INFO L93 Difference]: Finished difference Result 49650 states and 212030 transitions. [2022-03-03 17:13:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 17:13:52,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-03-03 17:13:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:13:53,206 INFO L225 Difference]: With dead ends: 49650 [2022-03-03 17:13:53,209 INFO L226 Difference]: Without dead ends: 47169 [2022-03-03 17:13:53,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:13:53,212 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 162 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:13:53,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 868 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:13:53,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47169 states. [2022-03-03 17:13:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47169 to 22104. [2022-03-03 17:13:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22104 states, 22103 states have (on average 4.187621589829435) internal successors, (92559), 22103 states have internal predecessors, (92559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22104 states to 22104 states and 92559 transitions. [2022-03-03 17:13:55,000 INFO L78 Accepts]: Start accepts. Automaton has 22104 states and 92559 transitions. Word has length 148 [2022-03-03 17:13:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:13:55,004 INFO L470 AbstractCegarLoop]: Abstraction has 22104 states and 92559 transitions. [2022-03-03 17:13:55,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22104 states and 92559 transitions. [2022-03-03 17:13:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-03-03 17:13:55,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:13:55,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:13:55,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:13:55,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:13:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:13:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1679654809, now seen corresponding path program 2 times [2022-03-03 17:13:55,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:13:55,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443248870] [2022-03-03 17:13:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:13:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:13:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:13:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:13:55,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:13:55,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443248870] [2022-03-03 17:13:55,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443248870] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:13:55,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:13:55,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:13:55,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647496472] [2022-03-03 17:13:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:13:55,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:13:55,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:13:55,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:13:55,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:13:55,267 INFO L87 Difference]: Start difference. First operand 22104 states and 92559 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:13:56,087 INFO L93 Difference]: Finished difference Result 56186 states and 238313 transitions. [2022-03-03 17:13:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 17:13:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-03-03 17:13:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:13:56,680 INFO L225 Difference]: With dead ends: 56186 [2022-03-03 17:13:56,680 INFO L226 Difference]: Without dead ends: 53705 [2022-03-03 17:13:56,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:13:56,683 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 125 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:13:56,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 863 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:13:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53705 states. [2022-03-03 17:13:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53705 to 24167. [2022-03-03 17:13:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24167 states, 24166 states have (on average 4.15596292311512) internal successors, (100433), 24166 states have internal predecessors, (100433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 100433 transitions. [2022-03-03 17:13:58,347 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 100433 transitions. Word has length 148 [2022-03-03 17:13:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:13:58,347 INFO L470 AbstractCegarLoop]: Abstraction has 24167 states and 100433 transitions. [2022-03-03 17:13:58,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 100433 transitions. [2022-03-03 17:13:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-03 17:13:58,408 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:13:58,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:13:58,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:13:58,408 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:13:58,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:13:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash 763966394, now seen corresponding path program 1 times [2022-03-03 17:13:58,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:13:58,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285856485] [2022-03-03 17:13:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:13:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:13:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:13:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:13:58,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:13:58,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285856485] [2022-03-03 17:13:58,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285856485] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:13:58,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:13:58,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 17:13:58,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716151892] [2022-03-03 17:13:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:13:58,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:13:58,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:13:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:13:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:13:58,538 INFO L87 Difference]: Start difference. First operand 24167 states and 100433 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:13:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:13:59,319 INFO L93 Difference]: Finished difference Result 46408 states and 191388 transitions. [2022-03-03 17:13:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:13:59,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2022-03-03 17:13:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:13:59,568 INFO L225 Difference]: With dead ends: 46408 [2022-03-03 17:13:59,568 INFO L226 Difference]: Without dead ends: 41314 [2022-03-03 17:13:59,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-03-03 17:13:59,569 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 680 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:13:59,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 701 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:13:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41314 states. [2022-03-03 17:14:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41314 to 31225. [2022-03-03 17:14:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 31224 states have (on average 4.112477581347681) internal successors, (128408), 31224 states have internal predecessors, (128408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 128408 transitions. [2022-03-03 17:14:00,909 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 128408 transitions. Word has length 152 [2022-03-03 17:14:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:00,909 INFO L470 AbstractCegarLoop]: Abstraction has 31225 states and 128408 transitions. [2022-03-03 17:14:00,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 128408 transitions. [2022-03-03 17:14:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-03-03 17:14:01,011 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:01,011 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:01,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:14:01,011 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1629900824, now seen corresponding path program 1 times [2022-03-03 17:14:01,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:01,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399998014] [2022-03-03 17:14:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:01,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:01,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399998014] [2022-03-03 17:14:01,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399998014] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:14:01,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:14:01,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 17:14:01,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531088624] [2022-03-03 17:14:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:14:01,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:14:01,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:14:01,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:14:01,130 INFO L87 Difference]: Start difference. First operand 31225 states and 128408 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:14:01,733 INFO L93 Difference]: Finished difference Result 31662 states and 127989 transitions. [2022-03-03 17:14:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:14:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2022-03-03 17:14:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:14:01,822 INFO L225 Difference]: With dead ends: 31662 [2022-03-03 17:14:01,822 INFO L226 Difference]: Without dead ends: 24173 [2022-03-03 17:14:01,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-03 17:14:01,823 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 454 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:14:01,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 606 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:14:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24173 states. [2022-03-03 17:14:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24173 to 24168. [2022-03-03 17:14:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24168 states, 24167 states have (on average 4.155832333347126) internal successors, (100434), 24167 states have internal predecessors, (100434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24168 states to 24168 states and 100434 transitions. [2022-03-03 17:14:02,582 INFO L78 Accepts]: Start accepts. Automaton has 24168 states and 100434 transitions. Word has length 152 [2022-03-03 17:14:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:02,583 INFO L470 AbstractCegarLoop]: Abstraction has 24168 states and 100434 transitions. [2022-03-03 17:14:02,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 24168 states and 100434 transitions. [2022-03-03 17:14:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-03 17:14:02,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:02,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:02,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:14:02,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1101759176, now seen corresponding path program 1 times [2022-03-03 17:14:02,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:02,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242305981] [2022-03-03 17:14:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:03,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:03,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242305981] [2022-03-03 17:14:03,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242305981] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:03,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965728959] [2022-03-03 17:14:03,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:03,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:03,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:03,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:14:03,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-03 17:14:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:03,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-03 17:14:03,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:14:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:03,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:14:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:04,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965728959] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:14:04,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:14:04,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-03 17:14:04,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463841785] [2022-03-03 17:14:04,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:14:04,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-03 17:14:04,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-03 17:14:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:14:04,107 INFO L87 Difference]: Start difference. First operand 24168 states and 100434 transitions. Second operand has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:14:05,075 INFO L93 Difference]: Finished difference Result 46415 states and 191395 transitions. [2022-03-03 17:14:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 17:14:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 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 159 [2022-03-03 17:14:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:14:05,306 INFO L225 Difference]: With dead ends: 46415 [2022-03-03 17:14:05,307 INFO L226 Difference]: Without dead ends: 41321 [2022-03-03 17:14:05,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-03-03 17:14:05,308 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 819 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:14:05,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [819 Valid, 1609 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 17:14:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41321 states. [2022-03-03 17:14:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41321 to 31232. [2022-03-03 17:14:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31232 states, 31231 states have (on average 4.111779962217028) internal successors, (128415), 31231 states have internal predecessors, (128415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31232 states to 31232 states and 128415 transitions. [2022-03-03 17:14:06,611 INFO L78 Accepts]: Start accepts. Automaton has 31232 states and 128415 transitions. Word has length 159 [2022-03-03 17:14:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:06,611 INFO L470 AbstractCegarLoop]: Abstraction has 31232 states and 128415 transitions. [2022-03-03 17:14:06,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31232 states and 128415 transitions. [2022-03-03 17:14:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-03-03 17:14:06,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:06,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:06,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-03 17:14:06,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-03 17:14:06,895 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash -235824746, now seen corresponding path program 1 times [2022-03-03 17:14:06,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:06,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710618469] [2022-03-03 17:14:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:06,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:07,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:07,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710618469] [2022-03-03 17:14:07,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710618469] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:07,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256910384] [2022-03-03 17:14:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:07,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:07,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:07,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:14:07,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-03 17:14:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:07,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 17:14:07,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:14:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:07,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:14:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:08,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256910384] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:14:08,029 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:14:08,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-03-03 17:14:08,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242617753] [2022-03-03 17:14:08,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:14:08,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-03 17:14:08,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-03 17:14:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-03-03 17:14:08,031 INFO L87 Difference]: Start difference. First operand 31232 states and 128415 transitions. Second operand has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:14:08,718 INFO L93 Difference]: Finished difference Result 31669 states and 126754 transitions. [2022-03-03 17:14:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-03 17:14:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 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 159 [2022-03-03 17:14:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:14:08,797 INFO L225 Difference]: With dead ends: 31669 [2022-03-03 17:14:08,797 INFO L226 Difference]: Without dead ends: 20796 [2022-03-03 17:14:08,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-03-03 17:14:08,798 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 898 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 17:14:08,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [898 Valid, 967 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 17:14:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2022-03-03 17:14:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20791. [2022-03-03 17:14:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20791 states, 20790 states have (on average 4.052236652236652) internal successors, (84246), 20790 states have internal predecessors, (84246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20791 states to 20791 states and 84246 transitions. [2022-03-03 17:14:09,517 INFO L78 Accepts]: Start accepts. Automaton has 20791 states and 84246 transitions. Word has length 159 [2022-03-03 17:14:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:09,517 INFO L470 AbstractCegarLoop]: Abstraction has 20791 states and 84246 transitions. [2022-03-03 17:14:09,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 20791 states and 84246 transitions. [2022-03-03 17:14:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-03-03 17:14:09,565 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:09,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:09,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-03 17:14:09,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-03 17:14:09,780 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 432613882, now seen corresponding path program 2 times [2022-03-03 17:14:09,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:09,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48737088] [2022-03-03 17:14:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:09,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:09,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48737088] [2022-03-03 17:14:09,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48737088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:09,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652768007] [2022-03-03 17:14:09,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:14:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:09,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:14:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-03 17:14:10,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:14:10,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:14:10,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-03 17:14:10,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:14:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:10,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:14:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:14:10,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652768007] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:10,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:14:10,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-03-03 17:14:10,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802136200] [2022-03-03 17:14:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:14:10,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:14:10,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:14:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:14:10,875 INFO L87 Difference]: Start difference. First operand 20791 states and 84246 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:14:11,352 INFO L93 Difference]: Finished difference Result 24097 states and 99434 transitions. [2022-03-03 17:14:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 17:14:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2022-03-03 17:14:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:14:11,437 INFO L225 Difference]: With dead ends: 24097 [2022-03-03 17:14:11,438 INFO L226 Difference]: Without dead ends: 23297 [2022-03-03 17:14:11,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-03-03 17:14:11,439 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 432 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:14:11,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 535 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:14:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23297 states. [2022-03-03 17:14:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23297 to 18721. [2022-03-03 17:14:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 18720 states have (on average 4.096581196581196) internal successors, (76688), 18720 states have internal predecessors, (76688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 76688 transitions. [2022-03-03 17:14:12,082 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 76688 transitions. Word has length 166 [2022-03-03 17:14:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:12,083 INFO L470 AbstractCegarLoop]: Abstraction has 18721 states and 76688 transitions. [2022-03-03 17:14:12,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 76688 transitions. [2022-03-03 17:14:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-03-03 17:14:12,126 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:12,126 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:12,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 17:14:12,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:12,352 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash -150055192, now seen corresponding path program 2 times [2022-03-03 17:14:12,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:12,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364067211] [2022-03-03 17:14:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:14:12,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:12,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364067211] [2022-03-03 17:14:12,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364067211] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:12,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299036221] [2022-03-03 17:14:12,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:14:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:12,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:14:12,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-03 17:14:12,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:14:12,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:14:12,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-03 17:14:12,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:14:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:14:13,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:14:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:14:13,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299036221] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:13,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:14:13,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-03-03 17:14:13,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293023486] [2022-03-03 17:14:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:14:13,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:14:13,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:14:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:14:13,492 INFO L87 Difference]: Start difference. First operand 18721 states and 76688 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:14:14,020 INFO L93 Difference]: Finished difference Result 26816 states and 110778 transitions. [2022-03-03 17:14:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 17:14:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2022-03-03 17:14:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:14:14,129 INFO L225 Difference]: With dead ends: 26816 [2022-03-03 17:14:14,130 INFO L226 Difference]: Without dead ends: 23578 [2022-03-03 17:14:14,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-03-03 17:14:14,130 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 365 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:14:14,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 627 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:14:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2022-03-03 17:14:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 20340. [2022-03-03 17:14:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20340 states, 20339 states have (on average 4.105708245243129) internal successors, (83506), 20339 states have internal predecessors, (83506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20340 states to 20340 states and 83506 transitions. [2022-03-03 17:14:14,799 INFO L78 Accepts]: Start accepts. Automaton has 20340 states and 83506 transitions. Word has length 166 [2022-03-03 17:14:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:14:14,799 INFO L470 AbstractCegarLoop]: Abstraction has 20340 states and 83506 transitions. [2022-03-03 17:14:14,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 20340 states and 83506 transitions. [2022-03-03 17:14:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-03 17:14:14,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:14:14,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:14:14,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-03 17:14:15,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:15,076 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:14:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:14:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1267312477, now seen corresponding path program 1 times [2022-03-03 17:14:15,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:14:15,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731500730] [2022-03-03 17:14:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:14:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:14:15,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:14:15,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731500730] [2022-03-03 17:14:15,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731500730] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:14:15,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859130560] [2022-03-03 17:14:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:14:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:14:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:14:15,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:14:15,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-03 17:14:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:14:15,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-03 17:14:15,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:14:16,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:14:16,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:14:16,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:14:16,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:14:16,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2022-03-03 17:14:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-03 17:14:17,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:14:17,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-03 17:14:17,470 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-03 17:14:17,496 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) is different from false [2022-03-03 17:14:17,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) is different from false [2022-03-03 17:14:17,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)))) is different from false [2022-03-03 17:14:17,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:14:17,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 221 [2022-03-03 17:14:17,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 201 [2022-03-03 17:14:17,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 193 [2022-03-03 17:14:17,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2022-03-03 17:14:17,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 169 [2022-03-03 17:14:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:14:18,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859130560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:14:18,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:14:18,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 47 [2022-03-03 17:14:18,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905580942] [2022-03-03 17:14:18,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:14:18,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-03 17:14:18,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:14:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-03 17:14:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1573, Unknown=5, NotChecked=420, Total=2162 [2022-03-03 17:14:18,156 INFO L87 Difference]: Start difference. First operand 20340 states and 83506 transitions. Second operand has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:14:21,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= c_~s_6~0 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)))) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-03-03 17:14:23,045 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-03-03 17:15:33,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~X_0~0.offset 0)))) is different from false [2022-03-03 17:15:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:15:36,719 INFO L93 Difference]: Finished difference Result 104064 states and 440799 transitions. [2022-03-03 17:15:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-03 17:15:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 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 170 [2022-03-03 17:15:36,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:15:37,575 INFO L225 Difference]: With dead ends: 104064 [2022-03-03 17:15:37,576 INFO L226 Difference]: Without dead ends: 100443 [2022-03-03 17:15:37,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 311 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 76.2s TimeCoverageRelationStatistics Valid=494, Invalid=4190, Unknown=40, NotChecked=1128, Total=5852 [2022-03-03 17:15:37,577 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 1571 mSDsluCounter, 9415 mSDsCounter, 0 mSdLazyCounter, 4557 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 8261 SdHoareTripleChecker+Invalid, 11174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6523 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:15:37,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1571 Valid, 8261 Invalid, 11174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4557 Invalid, 0 Unknown, 6523 Unchecked, 2.4s Time] [2022-03-03 17:15:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100443 states. [2022-03-03 17:15:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100443 to 22360. [2022-03-03 17:15:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22360 states, 22359 states have (on average 4.132429894002415) internal successors, (92397), 22359 states have internal predecessors, (92397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:15:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22360 states to 22360 states and 92397 transitions. [2022-03-03 17:15:39,385 INFO L78 Accepts]: Start accepts. Automaton has 22360 states and 92397 transitions. Word has length 170 [2022-03-03 17:15:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:15:39,385 INFO L470 AbstractCegarLoop]: Abstraction has 22360 states and 92397 transitions. [2022-03-03 17:15:39,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.0) internal successors, (282), 47 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:15:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22360 states and 92397 transitions. [2022-03-03 17:15:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-03 17:15:39,436 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:15:39,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:15:39,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-03 17:15:39,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-03 17:15:39,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:15:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:15:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1562631845, now seen corresponding path program 1 times [2022-03-03 17:15:39,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:15:39,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519458886] [2022-03-03 17:15:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:15:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:15:40,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:15:40,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519458886] [2022-03-03 17:15:40,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519458886] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:15:40,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154959317] [2022-03-03 17:15:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:15:40,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:15:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:15:40,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:15:40,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-03 17:15:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:15:40,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-03 17:15:40,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:15:40,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:15:40,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:15:40,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:15:40,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:15:40,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2022-03-03 17:15:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:15:41,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:15:41,521 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-03 17:15:41,580 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-03-03 17:15:41,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-03 17:15:41,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-03-03 17:15:41,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-03-03 17:15:41,694 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:15:41,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 445 treesize of output 293 [2022-03-03 17:15:41,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 269 [2022-03-03 17:15:41,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 261 [2022-03-03 17:15:41,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 245 [2022-03-03 17:15:41,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2022-03-03 17:15:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:15:42,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154959317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:15:42,248 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:15:42,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 45 [2022-03-03 17:15:42,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027075728] [2022-03-03 17:15:42,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:15:42,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-03 17:15:42,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:15:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-03 17:15:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1424, Unknown=5, NotChecked=400, Total=1980 [2022-03-03 17:15:42,250 INFO L87 Difference]: Start difference. First operand 22360 states and 92397 transitions. Second operand has 45 states, 45 states have (on average 5.977777777777778) internal successors, (269), 45 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:15:44,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= c_~s_6~0 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-03-03 17:15:46,857 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-03-03 17:18:37,146 WARN L228 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 68 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-03 17:18:43,345 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (= c_~X_0~0.offset 0)))) is different from false [2022-03-03 17:19:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:19:06,183 INFO L93 Difference]: Finished difference Result 106414 states and 451346 transitions. [2022-03-03 17:19:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-03 17:19:06,184 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.977777777777778) internal successors, (269), 45 states have internal predecessors, (269), 0 states have call successors, (0), 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 170 [2022-03-03 17:19:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:19:07,075 INFO L225 Difference]: With dead ends: 106414 [2022-03-03 17:19:07,076 INFO L226 Difference]: Without dead ends: 103093 [2022-03-03 17:19:07,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 314 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 3 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 202.0s TimeCoverageRelationStatistics Valid=501, Invalid=3773, Unknown=48, NotChecked=1080, Total=5402 [2022-03-03 17:19:07,077 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1669 mSDsluCounter, 7965 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 9098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5763 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:19:07,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1669 Valid, 6933 Invalid, 9098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3247 Invalid, 0 Unknown, 5763 Unchecked, 1.5s Time] [2022-03-03 17:19:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103093 states. [2022-03-03 17:19:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103093 to 23704. [2022-03-03 17:19:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23704 states, 23703 states have (on average 4.134708686664135) internal successors, (98005), 23703 states have internal predecessors, (98005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:19:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23704 states to 23704 states and 98005 transitions. [2022-03-03 17:19:08,909 INFO L78 Accepts]: Start accepts. Automaton has 23704 states and 98005 transitions. Word has length 170 [2022-03-03 17:19:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:19:08,910 INFO L470 AbstractCegarLoop]: Abstraction has 23704 states and 98005 transitions. [2022-03-03 17:19:08,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.977777777777778) internal successors, (269), 45 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:19:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 23704 states and 98005 transitions. [2022-03-03 17:19:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-03-03 17:19:08,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:19:08,961 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:19:08,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-03 17:19:09,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:19:09,162 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-03 17:19:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:19:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1061992675, now seen corresponding path program 2 times [2022-03-03 17:19:09,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:19:09,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625662966] [2022-03-03 17:19:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:19:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:19:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:19:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-03 17:19:09,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:19:09,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625662966] [2022-03-03 17:19:09,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625662966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:19:09,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039641587] [2022-03-03 17:19:09,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:19:09,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:19:09,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:19:09,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:19:09,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-03 17:19:09,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:19:09,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:19:09,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 92 conjunts are in the unsatisfiable core [2022-03-03 17:19:09,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:19:09,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:19:10,120 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-03 17:19:10,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-03 17:19:10,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:19:10,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:19:10,835 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-03 17:19:10,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-03 17:19:11,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:19:11,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:19:11,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:19:11,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-03-03 17:19:11,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2022-03-03 17:19:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:19:11,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:19:11,868 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_440 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-03 17:19:11,913 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-03-03 17:19:11,939 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-03-03 17:19:11,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-03-03 17:19:12,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-03-03 17:19:12,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-03-03 17:19:12,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)) (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (+ c_~X_0~0.offset 4))) (<= (select (select |c_#memory_int| c_~X_0~0.base) .cse0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (+ c_~X_0~0.offset 4))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1) (+ (select (select |c_#memory_int| c_~X_0~0.base) .cse1) 1))))))) is different from false [2022-03-03 17:19:12,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse1 (+ c_~X_0~0.offset 4))) (< (select (select (store (store .cse0 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse3 (+ c_~X_0~0.offset 4))) (<= (select (select .cse2 c_~X_0~0.base) .cse3) (select (select (store (store .cse2 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse3))))))) is different from false [2022-03-03 17:19:23,324 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:19:23,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-03-03 17:19:23,346 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:19:23,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13306 treesize of output 12232 [2022-03-03 17:19:23,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11941 treesize of output 11685 [2022-03-03 17:19:23,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11685 treesize of output 11557 [2022-03-03 17:19:23,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11557 treesize of output 10533 [2022-03-03 17:19:24,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10533 treesize of output 10021 [2022-03-03 17:19:24,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10021 treesize of output 9445 [2022-03-03 17:19:24,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9445 treesize of output 9301 [2022-03-03 17:19:24,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9301 treesize of output 8277 [2022-03-03 17:19:24,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8277 treesize of output 8021 [2022-03-03 17:19:24,216 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-03 17:19:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-03 17:19:24,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:19:24,419 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-03 17:19:24,425 INFO L158 Benchmark]: Toolchain (without parser) took 338339.27ms. Allocated memory was 177.2MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 121.4MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-03-03 17:19:24,425 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:19:24,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.34ms. Allocated memory is still 177.2MB. Free memory was 121.2MB in the beginning and 145.5MB in the end (delta: -24.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-03-03 17:19:24,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 177.2MB. Free memory was 145.5MB in the beginning and 143.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:19:24,425 INFO L158 Benchmark]: Boogie Preprocessor took 27.88ms. Allocated memory is still 177.2MB. Free memory was 143.1MB in the beginning and 141.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:19:24,426 INFO L158 Benchmark]: RCFGBuilder took 654.68ms. Allocated memory is still 177.2MB. Free memory was 141.0MB in the beginning and 106.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-03-03 17:19:24,426 INFO L158 Benchmark]: TraceAbstraction took 337374.60ms. Allocated memory was 177.2MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 105.7MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-03-03 17:19:24,427 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.12ms. Allocated memory is still 177.2MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.34ms. Allocated memory is still 177.2MB. Free memory was 121.2MB in the beginning and 145.5MB in the end (delta: -24.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 177.2MB. Free memory was 145.5MB in the beginning and 143.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.88ms. Allocated memory is still 177.2MB. Free memory was 143.1MB in the beginning and 141.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 654.68ms. Allocated memory is still 177.2MB. Free memory was 141.0MB in the beginning and 106.4MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 337374.60ms. Allocated memory was 177.2MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 105.7MB in the beginning and 4.3GB in the end (delta: -4.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-03 17:19:24,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...