/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.abstract-por-f0ea240 [2022-02-10 22:36:07,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 22:36:07,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 22:36:07,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 22:36:07,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 22:36:07,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 22:36:07,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 22:36:07,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 22:36:07,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 22:36:07,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 22:36:07,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 22:36:07,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 22:36:07,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 22:36:07,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 22:36:07,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 22:36:07,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 22:36:07,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 22:36:07,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 22:36:07,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 22:36:07,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 22:36:07,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 22:36:07,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 22:36:07,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 22:36:07,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 22:36:07,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 22:36:07,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 22:36:07,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 22:36:07,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 22:36:07,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 22:36:07,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 22:36:07,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 22:36:07,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 22:36:07,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 22:36:07,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 22:36:07,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 22:36:07,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 22:36:07,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 22:36:07,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 22:36:07,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 22:36:07,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 22:36:07,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 22:36:07,291 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-02-10 22:36:07,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 22:36:07,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 22:36:07,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 22:36:07,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 22:36:07,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 22:36:07,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 22:36:07,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 22:36:07,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 22:36:07,321 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 22:36:07,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 22:36:07,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 22:36:07,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 22:36:07,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 22:36:07,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 22:36:07,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 22:36:07,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 22:36:07,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 22:36:07,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 22:36:07,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 22:36:07,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 22:36:07,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 22:36:07,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 22:36:07,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 22:36:07,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 22:36:07,327 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 22:36:07,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 22:36:07,328 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-02-10 22:36:07,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 22:36:07,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 22:36:07,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 22:36:07,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 22:36:07,539 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 22:36:07,540 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-02-10 22:36:07,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1048ea44a/e49ea19923db4be8a017f15baefc23a1/FLAGca2c8f50f [2022-02-10 22:36:08,019 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 22:36:08,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-02-10 22:36:08,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1048ea44a/e49ea19923db4be8a017f15baefc23a1/FLAGca2c8f50f [2022-02-10 22:36:08,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1048ea44a/e49ea19923db4be8a017f15baefc23a1 [2022-02-10 22:36:08,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 22:36:08,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 22:36:08,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 22:36:08,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 22:36:08,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 22:36:08,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa02a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08, skipping insertion in model container [2022-02-10 22:36:08,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 22:36:08,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 22:36:08,267 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-02-10 22:36:08,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 22:36:08,285 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 22:36:08,304 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-02-10 22:36:08,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 22:36:08,319 INFO L208 MainTranslator]: Completed translation [2022-02-10 22:36:08,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08 WrapperNode [2022-02-10 22:36:08,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 22:36:08,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 22:36:08,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 22:36:08,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 22:36:08,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,356 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-02-10 22:36:08,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 22:36:08,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 22:36:08,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 22:36:08,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 22:36:08,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 22:36:08,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 22:36:08,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 22:36:08,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 22:36:08,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (1/1) ... [2022-02-10 22:36:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 22:36:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:08,412 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-02-10 22:36:08,414 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-02-10 22:36:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 22:36:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 22:36:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 22:36:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 22:36:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-10 22:36:08,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-10 22:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-10 22:36:08,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-10 22:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-10 22:36:08,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-10 22:36:08,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-02-10 22:36:08,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-02-10 22:36:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 22:36:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 22:36:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 22:36:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 22:36:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 22:36:08,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 22:36:08,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 22:36:08,453 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 22:36:08,528 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 22:36:08,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 22:36:08,839 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 22:36:09,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 22:36:09,009 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-10 22:36:09,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:36:09 BoogieIcfgContainer [2022-02-10 22:36:09,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 22:36:09,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 22:36:09,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 22:36:09,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 22:36:09,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 10:36:08" (1/3) ... [2022-02-10 22:36:09,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c1547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:36:09, skipping insertion in model container [2022-02-10 22:36:09,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:36:08" (2/3) ... [2022-02-10 22:36:09,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c1547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:36:09, skipping insertion in model container [2022-02-10 22:36:09,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:36:09" (3/3) ... [2022-02-10 22:36:09,023 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-02-10 22:36:09,029 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 22:36:09,030 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 22:36:09,030 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 22:36:09,030 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 22:36:09,094 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,094 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,095 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,095 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,095 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,095 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,096 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,096 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,096 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,096 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,096 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,097 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,097 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,097 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,097 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,097 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,098 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,098 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,098 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,099 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,100 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,101 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,102 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,102 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,102 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,102 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,103 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,104 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,105 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,106 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,106 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,106 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,106 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,106 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,107 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,107 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,109 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,110 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,111 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,112 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,112 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,112 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,112 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,112 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,113 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,113 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,113 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,113 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,113 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,114 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,115 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,118 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,118 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,118 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,118 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,119 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,119 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,119 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,119 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,119 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,120 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,121 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,122 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,123 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,123 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,123 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,123 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,123 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,124 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,125 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,125 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,125 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,126 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,126 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,126 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,126 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,126 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,127 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,127 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,132 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,133 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,134 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,134 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,134 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,134 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,134 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,135 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,135 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,135 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,135 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,135 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,136 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,137 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,137 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,137 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,137 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,137 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,138 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,138 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,143 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,143 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,143 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,144 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,145 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,145 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,145 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,145 WARN L322 ript$VariableManager]: TermVariable |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,147 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,148 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,149 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,149 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,149 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,149 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,149 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,150 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,151 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,151 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,153 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,157 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,157 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,158 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,158 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,158 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,158 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,159 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,159 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,160 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,161 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,161 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,161 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,162 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,163 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,163 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,172 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,172 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,172 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,172 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,173 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,174 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,174 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,174 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,174 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,174 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,175 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,176 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,176 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,176 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 22:36:09,182 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-02-10 22:36:09,243 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 22:36:09,251 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, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 22:36:09,252 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-10 22:36:09,267 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 204 places, 205 transitions, 454 flow [2022-02-10 22:36:10,144 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-02-10 22:36:10,207 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-02-10 22:36:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-10 22:36:10,418 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:10,419 INFO L515 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-02-10 22:36:10,420 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-02-10 22:36:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1525994273, now seen corresponding path program 1 times [2022-02-10 22:36:10,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:10,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13854590] [2022-02-10 22:36:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:10,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:10,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13854590] [2022-02-10 22:36:10,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13854590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:36:10,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:36:10,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 22:36:10,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76116984] [2022-02-10 22:36:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:10,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 22:36:10,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 22:36:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 22:36:10,870 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-02-10 22:36:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:11,325 INFO L93 Difference]: Finished difference Result 19453 states and 81672 transitions. [2022-02-10 22:36:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 22:36:11,329 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-02-10 22:36:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:11,631 INFO L225 Difference]: With dead ends: 19453 [2022-02-10 22:36:11,631 INFO L226 Difference]: Without dead ends: 19449 [2022-02-10 22:36:11,633 INFO L933 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-02-10 22:36:11,636 INFO L934 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.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:11,637 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2022-02-10 22:36:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2022-02-10 22:36:12,540 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-02-10 22:36:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 81668 transitions. [2022-02-10 22:36:12,648 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 81668 transitions. Word has length 145 [2022-02-10 22:36:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:12,650 INFO L470 AbstractCegarLoop]: Abstraction has 19449 states and 81668 transitions. [2022-02-10 22:36:12,651 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-02-10 22:36:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 81668 transitions. [2022-02-10 22:36:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 22:36:12,855 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:12,855 INFO L515 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-02-10 22:36:12,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 22:36:12,856 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-02-10 22:36:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 458105713, now seen corresponding path program 1 times [2022-02-10 22:36:12,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:12,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407291458] [2022-02-10 22:36:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:13,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:13,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407291458] [2022-02-10 22:36:13,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407291458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:36:13,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:36:13,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 22:36:13,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870327171] [2022-02-10 22:36:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:13,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 22:36:13,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 22:36:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 22:36:13,164 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-02-10 22:36:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:14,393 INFO L93 Difference]: Finished difference Result 53531 states and 227422 transitions. [2022-02-10 22:36:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 22:36:14,394 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-02-10 22:36:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:15,037 INFO L225 Difference]: With dead ends: 53531 [2022-02-10 22:36:15,037 INFO L226 Difference]: Without dead ends: 51050 [2022-02-10 22:36:15,041 INFO L933 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-02-10 22:36:15,043 INFO L934 BasicCegarLoop]: 197 mSDtfsCounter, 127 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:15,043 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 845 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51050 states. [2022-02-10 22:36:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51050 to 24095. [2022-02-10 22:36:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24095 states, 24094 states have (on average 4.160164356271271) internal successors, (100235), 24094 states have internal predecessors, (100235), 0 states have call successors, (0), 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-02-10 22:36:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24095 states to 24095 states and 100235 transitions. [2022-02-10 22:36:16,625 INFO L78 Accepts]: Start accepts. Automaton has 24095 states and 100235 transitions. Word has length 148 [2022-02-10 22:36:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:16,627 INFO L470 AbstractCegarLoop]: Abstraction has 24095 states and 100235 transitions. [2022-02-10 22:36:16,627 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-02-10 22:36:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24095 states and 100235 transitions. [2022-02-10 22:36:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-10 22:36:16,708 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:16,708 INFO L515 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-02-10 22:36:16,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 22:36:16,709 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-02-10 22:36:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 825797447, now seen corresponding path program 2 times [2022-02-10 22:36:16,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:16,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440755156] [2022-02-10 22:36:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:16,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:16,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440755156] [2022-02-10 22:36:16,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440755156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:36:16,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:36:16,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 22:36:16,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827111189] [2022-02-10 22:36:16,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:16,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 22:36:16,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 22:36:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 22:36:16,870 INFO L87 Difference]: Start difference. First operand 24095 states and 100235 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-02-10 22:36:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:17,710 INFO L93 Difference]: Finished difference Result 54200 states and 230333 transitions. [2022-02-10 22:36:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 22:36:17,711 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-02-10 22:36:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:18,207 INFO L225 Difference]: With dead ends: 54200 [2022-02-10 22:36:18,207 INFO L226 Difference]: Without dead ends: 51719 [2022-02-10 22:36:18,208 INFO L933 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-02-10 22:36:18,211 INFO L934 BasicCegarLoop]: 231 mSDtfsCounter, 118 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:18,211 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 986 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 22:36:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51719 states. [2022-02-10 22:36:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51719 to 24167. [2022-02-10 22:36:19,307 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-02-10 22:36:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 100433 transitions. [2022-02-10 22:36:19,396 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 100433 transitions. Word has length 148 [2022-02-10 22:36:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:19,397 INFO L470 AbstractCegarLoop]: Abstraction has 24167 states and 100433 transitions. [2022-02-10 22:36:19,397 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-02-10 22:36:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 100433 transitions. [2022-02-10 22:36:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-10 22:36:19,454 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:19,454 INFO L515 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-02-10 22:36:19,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 22:36:19,455 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-02-10 22:36:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 602226838, now seen corresponding path program 1 times [2022-02-10 22:36:19,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:19,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653941788] [2022-02-10 22:36:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:19,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:19,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653941788] [2022-02-10 22:36:19,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653941788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:36:19,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:36:19,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 22:36:19,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88935583] [2022-02-10 22:36:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:19,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 22:36:19,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 22:36:19,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-10 22:36:19,569 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-02-10 22:36:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:20,266 INFO L93 Difference]: Finished difference Result 46408 states and 191388 transitions. [2022-02-10 22:36:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-10 22:36:20,266 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-02-10 22:36:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:20,686 INFO L225 Difference]: With dead ends: 46408 [2022-02-10 22:36:20,686 INFO L226 Difference]: Without dead ends: 41314 [2022-02-10 22:36:20,686 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-10 22:36:20,687 INFO L934 BasicCegarLoop]: 179 mSDtfsCounter, 579 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:20,687 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 633 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41314 states. [2022-02-10 22:36:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41314 to 31225. [2022-02-10 22:36:21,625 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-02-10 22:36:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 128408 transitions. [2022-02-10 22:36:21,968 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 128408 transitions. Word has length 152 [2022-02-10 22:36:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:21,968 INFO L470 AbstractCegarLoop]: Abstraction has 31225 states and 128408 transitions. [2022-02-10 22:36:21,968 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-02-10 22:36:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 128408 transitions. [2022-02-10 22:36:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-10 22:36:22,056 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:22,056 INFO L515 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-02-10 22:36:22,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 22:36:22,056 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-02-10 22:36:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash 925961272, now seen corresponding path program 1 times [2022-02-10 22:36:22,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:22,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891290505] [2022-02-10 22:36:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:22,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:22,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891290505] [2022-02-10 22:36:22,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891290505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 22:36:22,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 22:36:22,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 22:36:22,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227180489] [2022-02-10 22:36:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:22,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 22:36:22,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 22:36:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 22:36:22,220 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-02-10 22:36:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:22,915 INFO L93 Difference]: Finished difference Result 31662 states and 126747 transitions. [2022-02-10 22:36:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-10 22:36:22,916 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-02-10 22:36:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:23,005 INFO L225 Difference]: With dead ends: 31662 [2022-02-10 22:36:23,006 INFO L226 Difference]: Without dead ends: 20789 [2022-02-10 22:36:23,006 INFO L933 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-02-10 22:36:23,007 INFO L934 BasicCegarLoop]: 154 mSDtfsCounter, 524 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:23,007 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 645 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2022-02-10 22:36:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 20784. [2022-02-10 22:36:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20784 states, 20783 states have (on average 4.053264687484964) internal successors, (84239), 20783 states have internal predecessors, (84239), 0 states have call successors, (0), 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-02-10 22:36:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20784 states to 20784 states and 84239 transitions. [2022-02-10 22:36:23,617 INFO L78 Accepts]: Start accepts. Automaton has 20784 states and 84239 transitions. Word has length 152 [2022-02-10 22:36:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:23,618 INFO L470 AbstractCegarLoop]: Abstraction has 20784 states and 84239 transitions. [2022-02-10 22:36:23,618 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-02-10 22:36:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20784 states and 84239 transitions. [2022-02-10 22:36:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-10 22:36:23,662 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:23,662 INFO L515 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-02-10 22:36:23,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 22:36:23,662 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-02-10 22:36:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1263498732, now seen corresponding path program 1 times [2022-02-10 22:36:23,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:23,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705913120] [2022-02-10 22:36:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:23,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:23,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705913120] [2022-02-10 22:36:23,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705913120] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:23,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686340642] [2022-02-10 22:36:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:23,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:23,824 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-02-10 22:36:23,827 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-02-10 22:36:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:23,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-10 22:36:23,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:24,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:25,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686340642] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:36:25,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:36:25,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-10 22:36:25,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84377267] [2022-02-10 22:36:25,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:36:25,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-10 22:36:25,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-10 22:36:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-02-10 22:36:25,069 INFO L87 Difference]: Start difference. First operand 20784 states and 84239 transitions. Second operand has 19 states, 19 states have (on average 10.736842105263158) internal successors, (204), 19 states have internal predecessors, (204), 0 states have call successors, (0), 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-02-10 22:36:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:25,762 INFO L93 Difference]: Finished difference Result 39863 states and 160291 transitions. [2022-02-10 22:36:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 22:36:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.736842105263158) internal successors, (204), 19 states have internal predecessors, (204), 0 states have call successors, (0), 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-02-10 22:36:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:25,932 INFO L225 Difference]: With dead ends: 39863 [2022-02-10 22:36:25,932 INFO L226 Difference]: Without dead ends: 34571 [2022-02-10 22:36:25,933 INFO L933 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-02-10 22:36:25,933 INFO L934 BasicCegarLoop]: 178 mSDtfsCounter, 1080 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:25,934 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1080 Valid, 1710 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 22:36:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34571 states. [2022-02-10 22:36:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34571 to 26462. [2022-02-10 22:36:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26462 states, 26461 states have (on average 4.016930577075696) internal successors, (106292), 26461 states have internal predecessors, (106292), 0 states have call successors, (0), 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-02-10 22:36:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26462 states to 26462 states and 106292 transitions. [2022-02-10 22:36:27,020 INFO L78 Accepts]: Start accepts. Automaton has 26462 states and 106292 transitions. Word has length 159 [2022-02-10 22:36:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:27,021 INFO L470 AbstractCegarLoop]: Abstraction has 26462 states and 106292 transitions. [2022-02-10 22:36:27,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.736842105263158) internal successors, (204), 19 states have internal predecessors, (204), 0 states have call successors, (0), 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-02-10 22:36:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26462 states and 106292 transitions. [2022-02-10 22:36:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-10 22:36:27,085 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:27,086 INFO L515 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-02-10 22:36:27,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-10 22:36:27,286 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-02-10 22:36:27,287 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-02-10 22:36:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -221543642, now seen corresponding path program 1 times [2022-02-10 22:36:27,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:27,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460692244] [2022-02-10 22:36:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:27,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:27,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460692244] [2022-02-10 22:36:27,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460692244] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:27,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214530950] [2022-02-10 22:36:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:27,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:27,436 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-02-10 22:36:27,438 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-02-10 22:36:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:27,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-10 22:36:27,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:27,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:28,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214530950] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:36:28,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:36:28,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-02-10 22:36:28,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236522977] [2022-02-10 22:36:28,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:36:28,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-10 22:36:28,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-10 22:36:28,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-02-10 22:36:28,400 INFO L87 Difference]: Start difference. First operand 26462 states and 106292 transitions. Second operand has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:36:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:29,057 INFO L93 Difference]: Finished difference Result 24919 states and 99000 transitions. [2022-02-10 22:36:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 22:36:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-02-10 22:36:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:29,145 INFO L225 Difference]: With dead ends: 24919 [2022-02-10 22:36:29,146 INFO L226 Difference]: Without dead ends: 20796 [2022-02-10 22:36:29,146 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2022-02-10 22:36:29,147 INFO L934 BasicCegarLoop]: 153 mSDtfsCounter, 813 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:29,147 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 1331 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 22:36:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2022-02-10 22:36:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20791. [2022-02-10 22:36:29,708 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-02-10 22:36:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20791 states to 20791 states and 84246 transitions. [2022-02-10 22:36:29,784 INFO L78 Accepts]: Start accepts. Automaton has 20791 states and 84246 transitions. Word has length 159 [2022-02-10 22:36:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:29,784 INFO L470 AbstractCegarLoop]: Abstraction has 20791 states and 84246 transitions. [2022-02-10 22:36:29,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.31578947368421) internal successors, (234), 19 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:36:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20791 states and 84246 transitions. [2022-02-10 22:36:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-02-10 22:36:29,827 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:29,827 INFO L515 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-02-10 22:36:29,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 22:36:30,047 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-02-10 22:36:30,048 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-02-10 22:36:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash 270874326, now seen corresponding path program 2 times [2022-02-10 22:36:30,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:30,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796527124] [2022-02-10 22:36:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:30,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:30,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796527124] [2022-02-10 22:36:30,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796527124] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:30,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695793012] [2022-02-10 22:36:30,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:36:30,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:30,194 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-02-10 22:36:30,195 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-02-10 22:36:30,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:36:30,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:36:30,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-10 22:36:30,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:30,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:31,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695793012] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:31,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-10 22:36:31,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-02-10 22:36:31,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062520878] [2022-02-10 22:36:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:31,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 22:36:31,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 22:36:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-10 22:36:31,249 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-02-10 22:36:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:31,549 INFO L93 Difference]: Finished difference Result 24097 states and 99434 transitions. [2022-02-10 22:36:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 22:36:31,550 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-02-10 22:36:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:31,638 INFO L225 Difference]: With dead ends: 24097 [2022-02-10 22:36:31,638 INFO L226 Difference]: Without dead ends: 23297 [2022-02-10 22:36:31,639 INFO L933 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-02-10 22:36:31,639 INFO L934 BasicCegarLoop]: 161 mSDtfsCounter, 594 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:31,640 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 535 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23297 states. [2022-02-10 22:36:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23297 to 18721. [2022-02-10 22:36:32,187 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-02-10 22:36:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 76688 transitions. [2022-02-10 22:36:32,251 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 76688 transitions. Word has length 166 [2022-02-10 22:36:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:32,251 INFO L470 AbstractCegarLoop]: Abstraction has 18721 states and 76688 transitions. [2022-02-10 22:36:32,252 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-02-10 22:36:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 76688 transitions. [2022-02-10 22:36:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-02-10 22:36:32,293 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:32,293 INFO L515 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-02-10 22:36:32,317 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-02-10 22:36:32,517 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-02-10 22:36:32,517 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-02-10 22:36:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1312829416, now seen corresponding path program 2 times [2022-02-10 22:36:32,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:32,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321784588] [2022-02-10 22:36:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:32,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:32,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:32,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321784588] [2022-02-10 22:36:32,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321784588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:32,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582201772] [2022-02-10 22:36:32,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:36:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:32,653 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-02-10 22:36:32,653 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-02-10 22:36:32,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:36:32,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:36:32,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-10 22:36:32,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:33,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-10 22:36:33,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582201772] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:33,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-10 22:36:33,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-02-10 22:36:33,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683285716] [2022-02-10 22:36:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 22:36:33,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 22:36:33,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 22:36:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-02-10 22:36:33,685 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-02-10 22:36:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:34,033 INFO L93 Difference]: Finished difference Result 26816 states and 110778 transitions. [2022-02-10 22:36:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 22:36:34,033 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-02-10 22:36:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:34,113 INFO L225 Difference]: With dead ends: 26816 [2022-02-10 22:36:34,113 INFO L226 Difference]: Without dead ends: 23578 [2022-02-10 22:36:34,113 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-02-10 22:36:34,114 INFO L934 BasicCegarLoop]: 186 mSDtfsCounter, 556 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:34,114 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [556 Valid, 563 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 22:36:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2022-02-10 22:36:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 20340. [2022-02-10 22:36:34,728 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-02-10 22:36:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20340 states to 20340 states and 83506 transitions. [2022-02-10 22:36:34,813 INFO L78 Accepts]: Start accepts. Automaton has 20340 states and 83506 transitions. Word has length 166 [2022-02-10 22:36:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:34,813 INFO L470 AbstractCegarLoop]: Abstraction has 20340 states and 83506 transitions. [2022-02-10 22:36:34,813 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-02-10 22:36:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20340 states and 83506 transitions. [2022-02-10 22:36:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:36:34,869 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:34,870 INFO L515 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-02-10 22:36:34,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-10 22:36:35,083 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-02-10 22:36:35,084 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-02-10 22:36:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1031682445, now seen corresponding path program 1 times [2022-02-10 22:36:35,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:35,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790993530] [2022-02-10 22:36:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:35,512 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:35,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790993530] [2022-02-10 22:36:35,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790993530] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:35,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630449095] [2022-02-10 22:36:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:35,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:35,513 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-02-10 22:36:35,514 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-02-10 22:36:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:35,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 22:36:35,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:35,854 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-02-10 22:36:35,953 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:36:35,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:36:36,333 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-02-10 22:36:36,420 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-02-10 22:36:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:36:36,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:36,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:36:36,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-02-10 22:36:36,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:36:36,844 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 54 treesize of output 45 [2022-02-10 22:36:36,848 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 16 treesize of output 12 [2022-02-10 22:36:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:36:37,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630449095] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:36:37,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:36:37,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 36 [2022-02-10 22:36:37,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827260704] [2022-02-10 22:36:37,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:36:37,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-10 22:36:37,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:37,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-10 22:36:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1022, Unknown=2, NotChecked=130, Total=1260 [2022-02-10 22:36:37,205 INFO L87 Difference]: Start difference. First operand 20340 states and 83506 transitions. Second operand has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-10 22:36:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:40,774 INFO L93 Difference]: Finished difference Result 113724 states and 478483 transitions. [2022-02-10 22:36:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-10 22:36:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-10 22:36:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:41,729 INFO L225 Difference]: With dead ends: 113724 [2022-02-10 22:36:41,729 INFO L226 Difference]: Without dead ends: 109642 [2022-02-10 22:36:41,730 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 318 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=678, Invalid=4298, Unknown=2, NotChecked=278, Total=5256 [2022-02-10 22:36:41,731 INFO L934 BasicCegarLoop]: 386 mSDtfsCounter, 1714 mSDsluCounter, 8305 mSDsCounter, 0 mSdLazyCounter, 3185 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 7513 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1752 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:41,731 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 7513 Invalid, 5055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3185 Invalid, 0 Unknown, 1752 Unchecked, 1.5s Time] [2022-02-10 22:36:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109642 states. [2022-02-10 22:36:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109642 to 24341. [2022-02-10 22:36:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24341 states, 24340 states have (on average 4.058545603944125) internal successors, (98785), 24340 states have internal predecessors, (98785), 0 states have call successors, (0), 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-02-10 22:36:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24341 states to 24341 states and 98785 transitions. [2022-02-10 22:36:43,560 INFO L78 Accepts]: Start accepts. Automaton has 24341 states and 98785 transitions. Word has length 170 [2022-02-10 22:36:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:43,561 INFO L470 AbstractCegarLoop]: Abstraction has 24341 states and 98785 transitions. [2022-02-10 22:36:43,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.555555555555555) internal successors, (344), 36 states have internal predecessors, (344), 0 states have call successors, (0), 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-02-10 22:36:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 24341 states and 98785 transitions. [2022-02-10 22:36:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:36:43,613 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:43,613 INFO L515 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-02-10 22:36:43,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-10 22:36:43,813 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-02-10 22:36:43,814 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-02-10 22:36:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 375242101, now seen corresponding path program 2 times [2022-02-10 22:36:43,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:43,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122523742] [2022-02-10 22:36:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:44,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:44,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122523742] [2022-02-10 22:36:44,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122523742] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:44,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458312231] [2022-02-10 22:36:44,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:36:44,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:44,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:44,236 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-02-10 22:36:44,236 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-02-10 22:36:44,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:36:44,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:36:44,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-10 22:36:44,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:44,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:36:44,864 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-02-10 22:36:44,944 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-02-10 22:36:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:45,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:45,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_383) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:36:45,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_383 (Array Int Int))) (= (+ c_~t_4~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_383) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:36:45,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:36:45,542 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 54 treesize of output 45 [2022-02-10 22:36:45,545 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 16 treesize of output 12 [2022-02-10 22:36:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:36:45,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458312231] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:36:45,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:36:45,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-02-10 22:36:45,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001983380] [2022-02-10 22:36:45,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:36:45,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 22:36:45,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 22:36:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1229, Unknown=2, NotChecked=142, Total=1482 [2022-02-10 22:36:45,999 INFO L87 Difference]: Start difference. First operand 24341 states and 98785 transitions. Second operand has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:36:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:49,613 INFO L93 Difference]: Finished difference Result 80424 states and 337566 transitions. [2022-02-10 22:36:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-10 22:36:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:36:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:49,970 INFO L225 Difference]: With dead ends: 80424 [2022-02-10 22:36:49,970 INFO L226 Difference]: Without dead ends: 73962 [2022-02-10 22:36:49,971 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 315 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=830, Invalid=4288, Unknown=2, NotChecked=282, Total=5402 [2022-02-10 22:36:49,971 INFO L934 BasicCegarLoop]: 323 mSDtfsCounter, 2635 mSDsluCounter, 6070 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2635 SdHoareTripleChecker+Valid, 5642 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1006 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:49,972 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2635 Valid, 5642 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2367 Invalid, 0 Unknown, 1006 Unchecked, 1.1s Time] [2022-02-10 22:36:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73962 states. [2022-02-10 22:36:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73962 to 26523. [2022-02-10 22:36:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26523 states, 26522 states have (on average 4.080159867279994) internal successors, (108214), 26522 states have internal predecessors, (108214), 0 states have call successors, (0), 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-02-10 22:36:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26523 states to 26523 states and 108214 transitions. [2022-02-10 22:36:51,523 INFO L78 Accepts]: Start accepts. Automaton has 26523 states and 108214 transitions. Word has length 170 [2022-02-10 22:36:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:51,523 INFO L470 AbstractCegarLoop]: Abstraction has 26523 states and 108214 transitions. [2022-02-10 22:36:51,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.692307692307692) internal successors, (378), 39 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:36:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26523 states and 108214 transitions. [2022-02-10 22:36:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:36:51,588 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:51,588 INFO L515 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-02-10 22:36:51,605 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-02-10 22:36:51,788 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-02-10 22:36:51,789 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-02-10 22:36:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash -731419125, now seen corresponding path program 3 times [2022-02-10 22:36:51,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:51,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582808384] [2022-02-10 22:36:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:52,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:52,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582808384] [2022-02-10 22:36:52,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582808384] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:52,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834688552] [2022-02-10 22:36:52,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:36:52,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:52,219 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-02-10 22:36:52,249 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-02-10 22:36:52,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:36:52,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:36:52,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-10 22:36:52,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:36:52,909 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 16 treesize of output 18 [2022-02-10 22:36:53,029 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-02-10 22:36:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:53,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:36:53,634 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_432 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:36:53,677 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:36:53,677 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 50 treesize of output 41 [2022-02-10 22:36:53,680 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 14 treesize of output 10 [2022-02-10 22:36:53,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:36:53,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:36:53,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-10 22:36:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:36:54,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834688552] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:36:54,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:36:54,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 38 [2022-02-10 22:36:54,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155979931] [2022-02-10 22:36:54,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:36:54,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 22:36:54,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:36:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 22:36:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-02-10 22:36:54,135 INFO L87 Difference]: Start difference. First operand 26523 states and 108214 transitions. Second operand has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 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-02-10 22:36:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:36:56,510 INFO L93 Difference]: Finished difference Result 79719 states and 337347 transitions. [2022-02-10 22:36:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 22:36:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 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-02-10 22:36:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:36:57,089 INFO L225 Difference]: With dead ends: 79719 [2022-02-10 22:36:57,090 INFO L226 Difference]: Without dead ends: 77918 [2022-02-10 22:36:57,090 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 317 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 3 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=485, Invalid=3178, Unknown=1, NotChecked=118, Total=3782 [2022-02-10 22:36:57,091 INFO L934 BasicCegarLoop]: 295 mSDtfsCounter, 1326 mSDsluCounter, 7551 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 6847 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 22:36:57,091 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 6847 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2255 Invalid, 0 Unknown, 561 Unchecked, 0.8s Time] [2022-02-10 22:36:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77918 states. [2022-02-10 22:36:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77918 to 26907. [2022-02-10 22:36:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26907 states, 26906 states have (on average 4.080353824425779) internal successors, (109786), 26906 states have internal predecessors, (109786), 0 states have call successors, (0), 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-02-10 22:36:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26907 states to 26907 states and 109786 transitions. [2022-02-10 22:36:58,673 INFO L78 Accepts]: Start accepts. Automaton has 26907 states and 109786 transitions. Word has length 170 [2022-02-10 22:36:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:36:58,674 INFO L470 AbstractCegarLoop]: Abstraction has 26907 states and 109786 transitions. [2022-02-10 22:36:58,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.68421052631579) internal successors, (330), 38 states have internal predecessors, (330), 0 states have call successors, (0), 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-02-10 22:36:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26907 states and 109786 transitions. [2022-02-10 22:36:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:36:58,734 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:36:58,735 INFO L515 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-02-10 22:36:58,752 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-02-10 22:36:58,935 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-02-10 22:36:58,935 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:36:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:36:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1760866055, now seen corresponding path program 4 times [2022-02-10 22:36:58,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:36:58,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735978364] [2022-02-10 22:36:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:36:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:36:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:36:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:36:59,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:36:59,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735978364] [2022-02-10 22:36:59,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735978364] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:36:59,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256537007] [2022-02-10 22:36:59,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:36:59,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:36:59,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:36:59,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:36:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-10 22:36:59,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:36:59,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:36:59,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 22:36:59,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:36:59,646 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-02-10 22:36:59,721 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:36:59,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:37:00,049 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 16 treesize of output 18 [2022-02-10 22:37:00,131 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 7 [2022-02-10 22:37:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:37:00,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:00,541 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_482 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_482) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_482 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_482) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:37:00,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:00,574 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 48 treesize of output 39 [2022-02-10 22:37:00,576 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 13 treesize of output 9 [2022-02-10 22:37:00,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:37:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:37:00,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-02-10 22:37:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:01,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256537007] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:01,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:01,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 17] total 39 [2022-02-10 22:37:01,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277626396] [2022-02-10 22:37:01,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:01,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 22:37:01,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 22:37:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1285, Unknown=1, NotChecked=72, Total=1482 [2022-02-10 22:37:01,010 INFO L87 Difference]: Start difference. First operand 26907 states and 109786 transitions. Second operand has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 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-02-10 22:37:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:03,240 INFO L93 Difference]: Finished difference Result 50976 states and 212590 transitions. [2022-02-10 22:37:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-10 22:37:03,240 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 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-02-10 22:37:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:03,404 INFO L225 Difference]: With dead ends: 50976 [2022-02-10 22:37:03,405 INFO L226 Difference]: Without dead ends: 47595 [2022-02-10 22:37:03,406 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 323 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=766, Invalid=4067, Unknown=1, NotChecked=136, Total=4970 [2022-02-10 22:37:03,406 INFO L934 BasicCegarLoop]: 264 mSDtfsCounter, 1458 mSDsluCounter, 5056 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:03,406 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1458 Valid, 4841 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2140 Invalid, 0 Unknown, 216 Unchecked, 0.8s Time] [2022-02-10 22:37:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47595 states. [2022-02-10 22:37:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47595 to 27387. [2022-02-10 22:37:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27387 states, 27386 states have (on average 4.085079967866793) internal successors, (111874), 27386 states have internal predecessors, (111874), 0 states have call successors, (0), 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-02-10 22:37:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27387 states to 27387 states and 111874 transitions. [2022-02-10 22:37:04,566 INFO L78 Accepts]: Start accepts. Automaton has 27387 states and 111874 transitions. Word has length 170 [2022-02-10 22:37:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:04,567 INFO L470 AbstractCegarLoop]: Abstraction has 27387 states and 111874 transitions. [2022-02-10 22:37:04,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.102564102564102) internal successors, (316), 39 states have internal predecessors, (316), 0 states have call successors, (0), 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-02-10 22:37:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 27387 states and 111874 transitions. [2022-02-10 22:37:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:04,632 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:04,632 INFO L515 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-02-10 22:37:04,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:04,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-10 22:37:04,833 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash -719236271, now seen corresponding path program 5 times [2022-02-10 22:37:04,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:04,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901583194] [2022-02-10 22:37:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:05,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:05,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901583194] [2022-02-10 22:37:05,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901583194] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:05,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949096788] [2022-02-10 22:37:05,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:37:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:05,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:05,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:05,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-10 22:37:05,302 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:37:05,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:05,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-10 22:37:05,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:05,339 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-02-10 22:37:05,436 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:37:05,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:37:05,708 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 16 treesize of output 18 [2022-02-10 22:37:05,784 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 7 [2022-02-10 22:37:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:05,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:06,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_532 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_532) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0))) (forall ((v_ArrVal_532 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_532) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-02-10 22:37:06,177 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:06,177 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 52 treesize of output 43 [2022-02-10 22:37:06,180 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 15 treesize of output 11 [2022-02-10 22:37:06,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:37:06,204 INFO L353 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2022-02-10 22:37:06,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2022-02-10 22:37:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:06,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949096788] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:06,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:06,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2022-02-10 22:37:06,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586439518] [2022-02-10 22:37:06,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:06,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-10 22:37:06,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-10 22:37:06,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2022-02-10 22:37:06,493 INFO L87 Difference]: Start difference. First operand 27387 states and 111874 transitions. Second operand has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:37:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:08,246 INFO L93 Difference]: Finished difference Result 52376 states and 219083 transitions. [2022-02-10 22:37:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 22:37:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:37:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:08,664 INFO L225 Difference]: With dead ends: 52376 [2022-02-10 22:37:08,664 INFO L226 Difference]: Without dead ends: 48515 [2022-02-10 22:37:08,665 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 323 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=593, Invalid=2832, Unknown=1, NotChecked=114, Total=3540 [2022-02-10 22:37:08,665 INFO L934 BasicCegarLoop]: 251 mSDtfsCounter, 1486 mSDsluCounter, 3922 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3764 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:08,666 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 3764 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1413 Invalid, 0 Unknown, 338 Unchecked, 0.6s Time] [2022-02-10 22:37:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48515 states. [2022-02-10 22:37:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48515 to 27819. [2022-02-10 22:37:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27819 states, 27818 states have (on average 4.088216262851391) internal successors, (113726), 27818 states have internal predecessors, (113726), 0 states have call successors, (0), 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-02-10 22:37:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27819 states to 27819 states and 113726 transitions. [2022-02-10 22:37:09,689 INFO L78 Accepts]: Start accepts. Automaton has 27819 states and 113726 transitions. Word has length 170 [2022-02-10 22:37:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:09,689 INFO L470 AbstractCegarLoop]: Abstraction has 27819 states and 113726 transitions. [2022-02-10 22:37:09,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.151515151515152) internal successors, (335), 33 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:37:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27819 states and 113726 transitions. [2022-02-10 22:37:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:09,748 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:09,749 INFO L515 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-02-10 22:37:09,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:09,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-10 22:37:09,950 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 250534987, now seen corresponding path program 6 times [2022-02-10 22:37:09,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:09,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750002995] [2022-02-10 22:37:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:10,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:10,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750002995] [2022-02-10 22:37:10,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750002995] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:10,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221145522] [2022-02-10 22:37:10,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:37:10,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:10,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:10,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-10 22:37:10,421 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:37:10,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:10,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-10 22:37:10,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:11,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:37:11,325 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 16 treesize of output 18 [2022-02-10 22:37:11,457 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-02-10 22:37:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:11,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:11,880 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_581) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_581 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_581) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:37:11,894 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:11,894 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 50 treesize of output 41 [2022-02-10 22:37:11,897 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 14 treesize of output 10 [2022-02-10 22:37:11,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:37:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:37:11,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-02-10 22:37:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:12,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221145522] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:12,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:12,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 26] total 54 [2022-02-10 22:37:12,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267335710] [2022-02-10 22:37:12,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:12,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-10 22:37:12,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:12,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-10 22:37:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2513, Unknown=1, NotChecked=102, Total=2862 [2022-02-10 22:37:12,651 INFO L87 Difference]: Start difference. First operand 27819 states and 113726 transitions. Second operand has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:37:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:16,702 INFO L93 Difference]: Finished difference Result 115385 states and 481253 transitions. [2022-02-10 22:37:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 22:37:16,703 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:37:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:17,951 INFO L225 Difference]: With dead ends: 115385 [2022-02-10 22:37:17,952 INFO L226 Difference]: Without dead ends: 108623 [2022-02-10 22:37:17,955 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 300 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1606, Invalid=8297, Unknown=1, NotChecked=196, Total=10100 [2022-02-10 22:37:17,957 INFO L934 BasicCegarLoop]: 286 mSDtfsCounter, 3925 mSDsluCounter, 6791 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3925 SdHoareTripleChecker+Valid, 6201 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:17,957 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3925 Valid, 6201 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2678 Invalid, 0 Unknown, 492 Unchecked, 1.6s Time] [2022-02-10 22:37:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108623 states. [2022-02-10 22:37:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108623 to 27435. [2022-02-10 22:37:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27435 states, 27434 states have (on average 4.08813880586134) internal successors, (112154), 27434 states have internal predecessors, (112154), 0 states have call successors, (0), 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-02-10 22:37:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27435 states to 27435 states and 112154 transitions. [2022-02-10 22:37:19,885 INFO L78 Accepts]: Start accepts. Automaton has 27435 states and 112154 transitions. Word has length 170 [2022-02-10 22:37:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:19,885 INFO L470 AbstractCegarLoop]: Abstraction has 27435 states and 112154 transitions. [2022-02-10 22:37:19,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.277777777777778) internal successors, (339), 54 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:37:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 27435 states and 112154 transitions. [2022-02-10 22:37:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:19,950 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:19,950 INFO L515 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-02-10 22:37:19,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:20,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-10 22:37:20,153 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1084604113, now seen corresponding path program 7 times [2022-02-10 22:37:20,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:20,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951414606] [2022-02-10 22:37:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:20,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:20,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951414606] [2022-02-10 22:37:20,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951414606] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:20,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246935292] [2022-02-10 22:37:20,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:37:20,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:20,428 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:20,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-10 22:37:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:20,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 22:37:20,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:20,897 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-02-10 22:37:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:37:21,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:21,426 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:21,427 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 26 treesize of output 27 [2022-02-10 22:37:21,443 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:37:21,444 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 25 treesize of output 12 [2022-02-10 22:37:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:21,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246935292] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:21,676 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:21,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 25 [2022-02-10 22:37:21,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995249460] [2022-02-10 22:37:21,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:21,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-10 22:37:21,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-10 22:37:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-02-10 22:37:21,678 INFO L87 Difference]: Start difference. First operand 27435 states and 112154 transitions. Second operand has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:37:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:23,126 INFO L93 Difference]: Finished difference Result 53180 states and 221733 transitions. [2022-02-10 22:37:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 22:37:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-02-10 22:37:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:23,370 INFO L225 Difference]: With dead ends: 53180 [2022-02-10 22:37:23,370 INFO L226 Difference]: Without dead ends: 49799 [2022-02-10 22:37:23,371 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1729, Unknown=0, NotChecked=0, Total=1980 [2022-02-10 22:37:23,371 INFO L934 BasicCegarLoop]: 274 mSDtfsCounter, 730 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:23,372 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [730 Valid, 4440 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-10 22:37:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49799 states. [2022-02-10 22:37:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49799 to 28491. [2022-02-10 22:37:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28491 states, 28490 states have (on average 4.097086697086697) internal successors, (116726), 28490 states have internal predecessors, (116726), 0 states have call successors, (0), 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-02-10 22:37:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28491 states to 28491 states and 116726 transitions. [2022-02-10 22:37:24,423 INFO L78 Accepts]: Start accepts. Automaton has 28491 states and 116726 transitions. Word has length 170 [2022-02-10 22:37:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:24,423 INFO L470 AbstractCegarLoop]: Abstraction has 28491 states and 116726 transitions. [2022-02-10 22:37:24,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.36) internal successors, (234), 25 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:37:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28491 states and 116726 transitions. [2022-02-10 22:37:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:24,489 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:24,489 INFO L515 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-02-10 22:37:24,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-10 22:37:24,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-10 22:37:24,690 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1652755541, now seen corresponding path program 8 times [2022-02-10 22:37:24,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:24,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414127692] [2022-02-10 22:37:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:25,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:25,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414127692] [2022-02-10 22:37:25,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414127692] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:25,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665456820] [2022-02-10 22:37:25,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:37:25,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:25,208 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:25,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-10 22:37:25,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:37:25,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:25,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 22:37:25,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:25,685 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 7 [2022-02-10 22:37:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:25,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:26,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:26,031 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 25 treesize of output 26 [2022-02-10 22:37:26,047 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:26,047 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 26 treesize of output 27 [2022-02-10 22:37:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:26,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665456820] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:26,262 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:26,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-02-10 22:37:26,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738389144] [2022-02-10 22:37:26,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:26,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 22:37:26,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 22:37:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-02-10 22:37:26,264 INFO L87 Difference]: Start difference. First operand 28491 states and 116726 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:27,240 INFO L93 Difference]: Finished difference Result 48879 states and 203472 transitions. [2022-02-10 22:37:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 22:37:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:27,405 INFO L225 Difference]: With dead ends: 48879 [2022-02-10 22:37:27,405 INFO L226 Difference]: Without dead ends: 45498 [2022-02-10 22:37:27,405 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 22:37:27,406 INFO L934 BasicCegarLoop]: 261 mSDtfsCounter, 699 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3049 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:27,406 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 3049 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 873 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-02-10 22:37:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45498 states. [2022-02-10 22:37:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45498 to 28611. [2022-02-10 22:37:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28611 states, 28610 states have (on average 4.098147500873821) internal successors, (117248), 28610 states have internal predecessors, (117248), 0 states have call successors, (0), 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-02-10 22:37:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28611 states to 28611 states and 117248 transitions. [2022-02-10 22:37:28,328 INFO L78 Accepts]: Start accepts. Automaton has 28611 states and 117248 transitions. Word has length 170 [2022-02-10 22:37:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:28,329 INFO L470 AbstractCegarLoop]: Abstraction has 28611 states and 117248 transitions. [2022-02-10 22:37:28,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28611 states and 117248 transitions. [2022-02-10 22:37:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:28,634 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:28,634 INFO L515 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-02-10 22:37:28,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-10 22:37:28,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-10 22:37:28,862 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1396512105, now seen corresponding path program 9 times [2022-02-10 22:37:28,863 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:28,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069386433] [2022-02-10 22:37:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:29,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:29,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069386433] [2022-02-10 22:37:29,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069386433] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:29,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140156617] [2022-02-10 22:37:29,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:37:29,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:29,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:29,108 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:29,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-10 22:37:29,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:37:29,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:29,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 22:37:29,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:29,589 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 7 [2022-02-10 22:37:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:29,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:29,912 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:29,912 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 26 treesize of output 27 [2022-02-10 22:37:29,930 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:29,930 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 25 treesize of output 26 [2022-02-10 22:37:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:30,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140156617] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:30,128 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:30,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-02-10 22:37:30,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987925909] [2022-02-10 22:37:30,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:30,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 22:37:30,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 22:37:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-02-10 22:37:30,129 INFO L87 Difference]: Start difference. First operand 28611 states and 117248 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:31,026 INFO L93 Difference]: Finished difference Result 47808 states and 199029 transitions. [2022-02-10 22:37:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 22:37:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:31,199 INFO L225 Difference]: With dead ends: 47808 [2022-02-10 22:37:31,199 INFO L226 Difference]: Without dead ends: 47627 [2022-02-10 22:37:31,199 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 334 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 22:37:31,200 INFO L934 BasicCegarLoop]: 250 mSDtfsCounter, 614 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:31,200 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 3053 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 816 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2022-02-10 22:37:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47627 states. [2022-02-10 22:37:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47627 to 32403. [2022-02-10 22:37:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32403 states, 32402 states have (on average 4.107524226899574) internal successors, (133092), 32402 states have internal predecessors, (133092), 0 states have call successors, (0), 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-02-10 22:37:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32403 states to 32403 states and 133092 transitions. [2022-02-10 22:37:32,414 INFO L78 Accepts]: Start accepts. Automaton has 32403 states and 133092 transitions. Word has length 170 [2022-02-10 22:37:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:32,414 INFO L470 AbstractCegarLoop]: Abstraction has 32403 states and 133092 transitions. [2022-02-10 22:37:32,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:37:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32403 states and 133092 transitions. [2022-02-10 22:37:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:32,492 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:32,492 INFO L515 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-02-10 22:37:32,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:32,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-10 22:37:32,694 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:32,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1805336330, now seen corresponding path program 1 times [2022-02-10 22:37:32,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:32,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397257185] [2022-02-10 22:37:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:32,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:32,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397257185] [2022-02-10 22:37:32,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397257185] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:32,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509245345] [2022-02-10 22:37:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:32,932 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:32,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-10 22:37:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:33,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 22:37:33,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:33,432 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 7 [2022-02-10 22:37:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:37:33,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:33,800 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:33,800 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 26 treesize of output 27 [2022-02-10 22:37:33,816 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:37:33,817 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 25 treesize of output 12 [2022-02-10 22:37:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:34,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509245345] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:34,051 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:34,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-02-10 22:37:34,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567575483] [2022-02-10 22:37:34,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:34,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-10 22:37:34,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-10 22:37:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-02-10 22:37:34,052 INFO L87 Difference]: Start difference. First operand 32403 states and 133092 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:35,327 INFO L93 Difference]: Finished difference Result 52779 states and 219937 transitions. [2022-02-10 22:37:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 22:37:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:35,496 INFO L225 Difference]: With dead ends: 52779 [2022-02-10 22:37:35,496 INFO L226 Difference]: Without dead ends: 47298 [2022-02-10 22:37:35,496 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-02-10 22:37:35,497 INFO L934 BasicCegarLoop]: 247 mSDtfsCounter, 661 mSDsluCounter, 4006 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 3821 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:35,497 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 3821 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 22:37:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47298 states. [2022-02-10 22:37:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47298 to 28131. [2022-02-10 22:37:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28131 states, 28130 states have (on average 4.093849982225382) internal successors, (115160), 28130 states have internal predecessors, (115160), 0 states have call successors, (0), 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-02-10 22:37:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28131 states to 28131 states and 115160 transitions. [2022-02-10 22:37:36,675 INFO L78 Accepts]: Start accepts. Automaton has 28131 states and 115160 transitions. Word has length 170 [2022-02-10 22:37:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:36,675 INFO L470 AbstractCegarLoop]: Abstraction has 28131 states and 115160 transitions. [2022-02-10 22:37:36,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28131 states and 115160 transitions. [2022-02-10 22:37:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:36,739 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:36,740 INFO L515 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-02-10 22:37:36,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:36,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:36,941 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 59627217, now seen corresponding path program 10 times [2022-02-10 22:37:36,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:36,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235022324] [2022-02-10 22:37:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:37,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:37,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235022324] [2022-02-10 22:37:37,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235022324] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:37,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778222754] [2022-02-10 22:37:37,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:37:37,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:37,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:37,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:37,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-10 22:37:37,351 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:37:37,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 22:37:37,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:37,665 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 7 [2022-02-10 22:37:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:37:37,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:38,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:38,003 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 26 treesize of output 27 [2022-02-10 22:37:38,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:37:38,018 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:38,018 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 25 treesize of output 12 [2022-02-10 22:37:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:38,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778222754] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:38,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:38,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-02-10 22:37:38,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452649454] [2022-02-10 22:37:38,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:38,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-10 22:37:38,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-10 22:37:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-02-10 22:37:38,222 INFO L87 Difference]: Start difference. First operand 28131 states and 115160 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:39,362 INFO L93 Difference]: Finished difference Result 49455 states and 205944 transitions. [2022-02-10 22:37:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 22:37:39,362 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:39,530 INFO L225 Difference]: With dead ends: 49455 [2022-02-10 22:37:39,530 INFO L226 Difference]: Without dead ends: 46074 [2022-02-10 22:37:39,530 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2022-02-10 22:37:39,531 INFO L934 BasicCegarLoop]: 266 mSDtfsCounter, 741 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:39,531 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [741 Valid, 3514 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-10 22:37:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2022-02-10 22:37:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 28471. [2022-02-10 22:37:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28471 states, 28470 states have (on average 4.097330523357921) internal successors, (116651), 28470 states have internal predecessors, (116651), 0 states have call successors, (0), 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-02-10 22:37:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28471 states to 28471 states and 116651 transitions. [2022-02-10 22:37:40,703 INFO L78 Accepts]: Start accepts. Automaton has 28471 states and 116651 transitions. Word has length 170 [2022-02-10 22:37:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:40,703 INFO L470 AbstractCegarLoop]: Abstraction has 28471 states and 116651 transitions. [2022-02-10 22:37:40,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:37:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28471 states and 116651 transitions. [2022-02-10 22:37:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:40,768 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:40,769 INFO L515 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-02-10 22:37:40,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:40,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:40,969 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1305326867, now seen corresponding path program 11 times [2022-02-10 22:37:40,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:40,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160836640] [2022-02-10 22:37:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:41,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:41,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160836640] [2022-02-10 22:37:41,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160836640] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:41,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678767209] [2022-02-10 22:37:41,221 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:37:41,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:41,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:41,224 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:41,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-10 22:37:41,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:37:41,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:41,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-10 22:37:41,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:41,614 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-02-10 22:37:41,819 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 13 treesize of output 9 [2022-02-10 22:37:41,972 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-02-10 22:37:42,019 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:37:42,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:37:42,120 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 6 treesize of output 5 [2022-02-10 22:37:42,189 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-02-10 22:37:42,259 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-02-10 22:37:42,539 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 7 [2022-02-10 22:37:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:42,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:42,960 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ c_~s_2~0 (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (+ (select .cse0 (+ c_~X_0~0.offset 4)) 1)))) (forall ((v_ArrVal_876 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse1 (+ c_~X_0~0.offset 4)) (+ c_~s_2~0 (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))))))) is different from false [2022-02-10 22:37:43,028 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ (select .cse0 (+ c_~X_0~0.offset 4)) 1)))) (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse1 (+ c_~X_0~0.offset 4)) (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))))) is different from false [2022-02-10 22:37:43,066 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_874) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (<= (select .cse0 (+ c_~X_0~0.offset 4)) (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_874) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_875) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_876) c_~X_0~0.base))) (< (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ (select .cse1 (+ c_~X_0~0.offset 4)) 1))))) is different from false [2022-02-10 22:37:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:37:43,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678767209] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:43,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:43,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 13] total 42 [2022-02-10 22:37:43,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298400589] [2022-02-10 22:37:43,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:43,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 22:37:43,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:43,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 22:37:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1350, Unknown=3, NotChecked=228, Total=1722 [2022-02-10 22:37:43,165 INFO L87 Difference]: Start difference. First operand 28471 states and 116651 transitions. Second operand has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:37:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:45,808 INFO L93 Difference]: Finished difference Result 49413 states and 205998 transitions. [2022-02-10 22:37:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-10 22:37:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-02-10 22:37:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:45,971 INFO L225 Difference]: With dead ends: 49413 [2022-02-10 22:37:45,971 INFO L226 Difference]: Without dead ends: 45792 [2022-02-10 22:37:45,972 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 317 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=697, Invalid=4142, Unknown=3, NotChecked=414, Total=5256 [2022-02-10 22:37:45,973 INFO L934 BasicCegarLoop]: 251 mSDtfsCounter, 1709 mSDsluCounter, 5385 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 3750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:45,973 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1709 Valid, 4916 Invalid, 3750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2468 Invalid, 0 Unknown, 1207 Unchecked, 1.0s Time] [2022-02-10 22:37:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45792 states. [2022-02-10 22:37:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45792 to 28703. [2022-02-10 22:37:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28703 states, 28702 states have (on average 4.099122012403317) internal successors, (117653), 28702 states have internal predecessors, (117653), 0 states have call successors, (0), 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-02-10 22:37:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28703 states to 28703 states and 117653 transitions. [2022-02-10 22:37:47,119 INFO L78 Accepts]: Start accepts. Automaton has 28703 states and 117653 transitions. Word has length 170 [2022-02-10 22:37:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:47,119 INFO L470 AbstractCegarLoop]: Abstraction has 28703 states and 117653 transitions. [2022-02-10 22:37:47,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.904761904761905) internal successors, (332), 42 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:37:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28703 states and 117653 transitions. [2022-02-10 22:37:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:47,191 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:47,191 INFO L515 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-02-10 22:37:47,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:47,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:47,405 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1227671575, now seen corresponding path program 12 times [2022-02-10 22:37:47,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:47,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629839633] [2022-02-10 22:37:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:37:47,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:47,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629839633] [2022-02-10 22:37:47,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629839633] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:47,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238816885] [2022-02-10 22:37:47,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:37:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:47,633 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-10 22:37:47,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:37:47,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:37:47,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-10 22:37:47,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:48,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:48,413 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 25 treesize of output 25 [2022-02-10 22:37:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:48,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:48,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:48,938 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 50 treesize of output 34 [2022-02-10 22:37:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:49,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238816885] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:49,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:49,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 38 [2022-02-10 22:37:49,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244191525] [2022-02-10 22:37:49,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:49,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 22:37:49,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 22:37:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 22:37:49,914 INFO L87 Difference]: Start difference. First operand 28703 states and 117653 transitions. Second operand has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 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-02-10 22:37:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:37:51,980 INFO L93 Difference]: Finished difference Result 65034 states and 272496 transitions. [2022-02-10 22:37:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-10 22:37:51,980 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 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-02-10 22:37:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:37:52,242 INFO L225 Difference]: With dead ends: 65034 [2022-02-10 22:37:52,242 INFO L226 Difference]: Without dead ends: 61413 [2022-02-10 22:37:52,242 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=794, Invalid=3898, Unknown=0, NotChecked=0, Total=4692 [2022-02-10 22:37:52,243 INFO L934 BasicCegarLoop]: 273 mSDtfsCounter, 1804 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:37:52,243 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 4644 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1752 Invalid, 0 Unknown, 233 Unchecked, 0.7s Time] [2022-02-10 22:37:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61413 states. [2022-02-10 22:37:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 30023. [2022-02-10 22:37:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30023 states, 30022 states have (on average 4.112550796082872) internal successors, (123467), 30022 states have internal predecessors, (123467), 0 states have call successors, (0), 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-02-10 22:37:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30023 states to 30023 states and 123467 transitions. [2022-02-10 22:37:53,545 INFO L78 Accepts]: Start accepts. Automaton has 30023 states and 123467 transitions. Word has length 170 [2022-02-10 22:37:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:37:53,545 INFO L470 AbstractCegarLoop]: Abstraction has 30023 states and 123467 transitions. [2022-02-10 22:37:53,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.421052631578947) internal successors, (320), 38 states have internal predecessors, (320), 0 states have call successors, (0), 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-02-10 22:37:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30023 states and 123467 transitions. [2022-02-10 22:37:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:37:53,611 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:37:53,611 INFO L515 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-02-10 22:37:53,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-10 22:37:53,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:53,813 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:37:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:37:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1654931019, now seen corresponding path program 1 times [2022-02-10 22:37:53,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:37:53,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542511163] [2022-02-10 22:37:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:37:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:37:54,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:37:54,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542511163] [2022-02-10 22:37:54,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542511163] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:37:54,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679540621] [2022-02-10 22:37:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:37:54,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:37:54,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:37:54,508 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:37:54,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-10 22:37:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:37:54,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 22:37:54,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:37:54,704 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-02-10 22:37:54,810 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:37:54,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:37:55,383 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 16 treesize of output 18 [2022-02-10 22:37:55,452 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 7 [2022-02-10 22:37:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:37:55,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:37:55,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_974) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) c_~s_2~0)) is different from false [2022-02-10 22:37:55,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_974) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-02-10 22:37:55,823 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:37:55,823 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 48 treesize of output 39 [2022-02-10 22:37:55,826 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 13 treesize of output 9 [2022-02-10 22:37:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:37:56,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679540621] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:37:56,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:37:56,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 17] total 46 [2022-02-10 22:37:56,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108004262] [2022-02-10 22:37:56,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:37:56,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-10 22:37:56,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:37:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-10 22:37:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1755, Unknown=2, NotChecked=170, Total=2070 [2022-02-10 22:37:56,110 INFO L87 Difference]: Start difference. First operand 30023 states and 123467 transitions. Second operand has 46 states, 46 states have (on average 7.695652173913044) internal successors, (354), 46 states have internal predecessors, (354), 0 states have call successors, (0), 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-02-10 22:38:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:01,723 INFO L93 Difference]: Finished difference Result 195528 states and 821634 transitions. [2022-02-10 22:38:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-10 22:38:01,723 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 7.695652173913044) internal successors, (354), 46 states have internal predecessors, (354), 0 states have call successors, (0), 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-02-10 22:38:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:03,114 INFO L225 Difference]: With dead ends: 195528 [2022-02-10 22:38:03,114 INFO L226 Difference]: Without dead ends: 189486 [2022-02-10 22:38:03,115 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 320 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1245, Invalid=8861, Unknown=2, NotChecked=398, Total=10506 [2022-02-10 22:38:03,115 INFO L934 BasicCegarLoop]: 312 mSDtfsCounter, 4224 mSDsluCounter, 9149 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 8234 SdHoareTripleChecker+Invalid, 5279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 986 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:03,116 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4224 Valid, 8234 Invalid, 5279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 4099 Invalid, 0 Unknown, 986 Unchecked, 1.6s Time] [2022-02-10 22:38:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189486 states. [2022-02-10 22:38:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189486 to 31159. [2022-02-10 22:38:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31159 states, 31158 states have (on average 4.104884780794659) internal successors, (127900), 31158 states have internal predecessors, (127900), 0 states have call successors, (0), 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-02-10 22:38:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31159 states to 31159 states and 127900 transitions. [2022-02-10 22:38:06,492 INFO L78 Accepts]: Start accepts. Automaton has 31159 states and 127900 transitions. Word has length 170 [2022-02-10 22:38:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:06,493 INFO L470 AbstractCegarLoop]: Abstraction has 31159 states and 127900 transitions. [2022-02-10 22:38:06,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.695652173913044) internal successors, (354), 46 states have internal predecessors, (354), 0 states have call successors, (0), 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-02-10 22:38:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31159 states and 127900 transitions. [2022-02-10 22:38:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:06,955 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:06,956 INFO L515 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-02-10 22:38:06,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:07,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:07,172 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1504978293, now seen corresponding path program 2 times [2022-02-10 22:38:07,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:07,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225608233] [2022-02-10 22:38:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:07,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:07,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225608233] [2022-02-10 22:38:07,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225608233] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:07,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636494708] [2022-02-10 22:38:07,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:38:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:07,476 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:07,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-10 22:38:07,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:38:07,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:07,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-10 22:38:07,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:08,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:38:08,227 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 16 treesize of output 18 [2022-02-10 22:38:08,320 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 15 treesize of output 7 [2022-02-10 22:38:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:08,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:08,693 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1023 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 c_~s_2~0))) (forall ((v_ArrVal_1023 (Array Int Int))) (< (+ c_~t_5~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1023) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-02-10 22:38:08,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:08,739 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 48 treesize of output 39 [2022-02-10 22:38:08,741 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 13 treesize of output 9 [2022-02-10 22:38:08,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:38:08,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:38:08,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2022-02-10 22:38:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:09,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636494708] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:09,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:09,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-02-10 22:38:09,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620907293] [2022-02-10 22:38:09,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:09,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 22:38:09,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 22:38:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1287, Unknown=1, NotChecked=72, Total=1482 [2022-02-10 22:38:09,127 INFO L87 Difference]: Start difference. First operand 31159 states and 127900 transitions. Second operand has 39 states, 39 states have (on average 9.564102564102564) internal successors, (373), 39 states have internal predecessors, (373), 0 states have call successors, (0), 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-02-10 22:38:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:11,220 INFO L93 Difference]: Finished difference Result 52154 states and 219005 transitions. [2022-02-10 22:38:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-10 22:38:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 9.564102564102564) internal successors, (373), 39 states have internal predecessors, (373), 0 states have call successors, (0), 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-02-10 22:38:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:11,416 INFO L225 Difference]: With dead ends: 52154 [2022-02-10 22:38:11,416 INFO L226 Difference]: Without dead ends: 48833 [2022-02-10 22:38:11,416 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=647, Invalid=3262, Unknown=1, NotChecked=122, Total=4032 [2022-02-10 22:38:11,417 INFO L934 BasicCegarLoop]: 237 mSDtfsCounter, 1471 mSDsluCounter, 4547 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:11,417 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1471 Valid, 4271 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1702 Invalid, 0 Unknown, 385 Unchecked, 0.7s Time] [2022-02-10 22:38:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48833 states. [2022-02-10 22:38:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48833 to 31969. [2022-02-10 22:38:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31969 states, 31968 states have (on average 4.111705455455455) internal successors, (131443), 31968 states have internal predecessors, (131443), 0 states have call successors, (0), 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-02-10 22:38:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31969 states to 31969 states and 131443 transitions. [2022-02-10 22:38:12,689 INFO L78 Accepts]: Start accepts. Automaton has 31969 states and 131443 transitions. Word has length 170 [2022-02-10 22:38:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:12,689 INFO L470 AbstractCegarLoop]: Abstraction has 31969 states and 131443 transitions. [2022-02-10 22:38:12,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.564102564102564) internal successors, (373), 39 states have internal predecessors, (373), 0 states have call successors, (0), 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-02-10 22:38:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31969 states and 131443 transitions. [2022-02-10 22:38:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:12,768 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:12,768 INFO L515 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-02-10 22:38:12,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-10 22:38:12,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:12,969 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2128214077, now seen corresponding path program 3 times [2022-02-10 22:38:12,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:12,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313159893] [2022-02-10 22:38:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:13,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:13,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313159893] [2022-02-10 22:38:13,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313159893] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:13,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018630122] [2022-02-10 22:38:13,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:38:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:13,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:13,256 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:13,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-10 22:38:13,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:38:13,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:13,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-10 22:38:13,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:13,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:38:13,982 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 16 treesize of output 18 [2022-02-10 22:38:14,061 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 7 [2022-02-10 22:38:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:14,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:14,439 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1072 (Array Int Int))) (<= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1072) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1072 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1072) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:38:14,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:14,479 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 50 treesize of output 41 [2022-02-10 22:38:14,481 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 14 treesize of output 10 [2022-02-10 22:38:14,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:38:14,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:14,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-02-10 22:38:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:14,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018630122] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:14,875 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:14,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-02-10 22:38:14,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249692584] [2022-02-10 22:38:14,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:14,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-10 22:38:14,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-10 22:38:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1222, Unknown=1, NotChecked=70, Total=1406 [2022-02-10 22:38:14,876 INFO L87 Difference]: Start difference. First operand 31969 states and 131443 transitions. Second operand has 38 states, 38 states have (on average 8.631578947368421) internal successors, (328), 38 states have internal predecessors, (328), 0 states have call successors, (0), 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-02-10 22:38:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:17,324 INFO L93 Difference]: Finished difference Result 63200 states and 258395 transitions. [2022-02-10 22:38:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-10 22:38:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 8.631578947368421) internal successors, (328), 38 states have internal predecessors, (328), 0 states have call successors, (0), 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-02-10 22:38:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:17,557 INFO L225 Difference]: With dead ends: 63200 [2022-02-10 22:38:17,558 INFO L226 Difference]: Without dead ends: 59018 [2022-02-10 22:38:17,558 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 319 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=707, Invalid=3586, Unknown=1, NotChecked=128, Total=4422 [2022-02-10 22:38:17,558 INFO L934 BasicCegarLoop]: 254 mSDtfsCounter, 2129 mSDsluCounter, 4821 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:17,559 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2129 Valid, 4454 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1688 Invalid, 0 Unknown, 407 Unchecked, 0.7s Time] [2022-02-10 22:38:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59018 states. [2022-02-10 22:38:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59018 to 31969. [2022-02-10 22:38:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31969 states, 31968 states have (on average 4.111705455455455) internal successors, (131443), 31968 states have internal predecessors, (131443), 0 states have call successors, (0), 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-02-10 22:38:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31969 states to 31969 states and 131443 transitions. [2022-02-10 22:38:19,386 INFO L78 Accepts]: Start accepts. Automaton has 31969 states and 131443 transitions. Word has length 170 [2022-02-10 22:38:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:19,386 INFO L470 AbstractCegarLoop]: Abstraction has 31969 states and 131443 transitions. [2022-02-10 22:38:19,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.631578947368421) internal successors, (328), 38 states have internal predecessors, (328), 0 states have call successors, (0), 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-02-10 22:38:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31969 states and 131443 transitions. [2022-02-10 22:38:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:19,460 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:19,460 INFO L515 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-02-10 22:38:19,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:19,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-10 22:38:19,661 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 770087149, now seen corresponding path program 4 times [2022-02-10 22:38:19,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:19,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687660498] [2022-02-10 22:38:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:19,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:19,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687660498] [2022-02-10 22:38:19,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687660498] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:19,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707954680] [2022-02-10 22:38:19,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:38:19,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:19,972 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-10 22:38:20,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:38:20,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:20,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-10 22:38:20,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:20,155 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-02-10 22:38:20,268 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:38:20,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:38:20,554 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 16 treesize of output 18 [2022-02-10 22:38:20,661 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 7 [2022-02-10 22:38:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:38:21,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:21,254 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1122) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_5~0 1 c_~s_2~0))) (forall ((v_ArrVal_1122 (Array Int Int))) (<= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1122) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:38:21,304 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:21,304 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 50 treesize of output 41 [2022-02-10 22:38:21,313 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 14 treesize of output 10 [2022-02-10 22:38:21,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:38:21,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:38:21,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-02-10 22:38:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:21,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707954680] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:21,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:21,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 36 [2022-02-10 22:38:21,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147778652] [2022-02-10 22:38:21,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:21,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-10 22:38:21,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-10 22:38:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1086, Unknown=1, NotChecked=66, Total=1260 [2022-02-10 22:38:21,592 INFO L87 Difference]: Start difference. First operand 31969 states and 131443 transitions. Second operand has 36 states, 36 states have (on average 9.63888888888889) internal successors, (347), 36 states have internal predecessors, (347), 0 states have call successors, (0), 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-02-10 22:38:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:23,599 INFO L93 Difference]: Finished difference Result 55882 states and 235032 transitions. [2022-02-10 22:38:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 22:38:23,600 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 9.63888888888889) internal successors, (347), 36 states have internal predecessors, (347), 0 states have call successors, (0), 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-02-10 22:38:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:23,802 INFO L225 Difference]: With dead ends: 55882 [2022-02-10 22:38:23,802 INFO L226 Difference]: Without dead ends: 52861 [2022-02-10 22:38:23,802 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 320 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=3465, Unknown=1, NotChecked=124, Total=4160 [2022-02-10 22:38:23,803 INFO L934 BasicCegarLoop]: 263 mSDtfsCounter, 1465 mSDsluCounter, 5050 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 4650 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:23,803 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1465 Valid, 4650 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2121 Invalid, 0 Unknown, 361 Unchecked, 0.8s Time] [2022-02-10 22:38:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52861 states. [2022-02-10 22:38:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52861 to 31969. [2022-02-10 22:38:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31969 states, 31968 states have (on average 4.111705455455455) internal successors, (131443), 31968 states have internal predecessors, (131443), 0 states have call successors, (0), 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-02-10 22:38:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31969 states to 31969 states and 131443 transitions. [2022-02-10 22:38:25,045 INFO L78 Accepts]: Start accepts. Automaton has 31969 states and 131443 transitions. Word has length 170 [2022-02-10 22:38:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:25,045 INFO L470 AbstractCegarLoop]: Abstraction has 31969 states and 131443 transitions. [2022-02-10 22:38:25,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.63888888888889) internal successors, (347), 36 states have internal predecessors, (347), 0 states have call successors, (0), 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-02-10 22:38:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31969 states and 131443 transitions. [2022-02-10 22:38:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:25,117 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:25,117 INFO L515 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-02-10 22:38:25,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:25,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-10 22:38:25,318 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2130006555, now seen corresponding path program 5 times [2022-02-10 22:38:25,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:25,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094003359] [2022-02-10 22:38:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:25,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:25,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094003359] [2022-02-10 22:38:25,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094003359] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:25,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951497659] [2022-02-10 22:38:25,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:38:25,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:25,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:25,640 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:25,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-10 22:38:25,773 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:38:25,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:25,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-10 22:38:25,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:25,802 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-02-10 22:38:25,888 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:38:25,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:38:26,183 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 16 treesize of output 18 [2022-02-10 22:38:26,252 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 7 [2022-02-10 22:38:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:26,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:26,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array Int Int))) (= c_~s_2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1172) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-02-10 22:38:26,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 (Array Int Int))) (= (+ c_~t_5~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1172) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) is different from false [2022-02-10 22:38:26,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:26,599 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 48 treesize of output 39 [2022-02-10 22:38:26,601 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 13 treesize of output 9 [2022-02-10 22:38:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:38:27,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951497659] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:27,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:27,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-02-10 22:38:27,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44420450] [2022-02-10 22:38:27,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:27,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-10 22:38:27,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:27,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-10 22:38:27,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=898, Unknown=2, NotChecked=122, Total=1122 [2022-02-10 22:38:27,045 INFO L87 Difference]: Start difference. First operand 31969 states and 131443 transitions. Second operand has 34 states, 34 states have (on average 10.088235294117647) internal successors, (343), 34 states have internal predecessors, (343), 0 states have call successors, (0), 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-02-10 22:38:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:30,202 INFO L93 Difference]: Finished difference Result 109337 states and 458711 transitions. [2022-02-10 22:38:30,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-10 22:38:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 10.088235294117647) internal successors, (343), 34 states have internal predecessors, (343), 0 states have call successors, (0), 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-02-10 22:38:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:30,775 INFO L225 Difference]: With dead ends: 109337 [2022-02-10 22:38:30,775 INFO L226 Difference]: Without dead ends: 107015 [2022-02-10 22:38:30,776 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 322 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=803, Invalid=3895, Unknown=2, NotChecked=270, Total=4970 [2022-02-10 22:38:30,776 INFO L934 BasicCegarLoop]: 368 mSDtfsCounter, 1846 mSDsluCounter, 6536 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 6046 SdHoareTripleChecker+Invalid, 3980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1105 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:30,776 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 6046 Invalid, 3980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2757 Invalid, 0 Unknown, 1105 Unchecked, 1.1s Time] [2022-02-10 22:38:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107015 states. [2022-02-10 22:38:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107015 to 31253. [2022-02-10 22:38:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31253 states, 31252 states have (on average 4.119928324587226) internal successors, (128756), 31252 states have internal predecessors, (128756), 0 states have call successors, (0), 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-02-10 22:38:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31253 states to 31253 states and 128756 transitions. [2022-02-10 22:38:32,719 INFO L78 Accepts]: Start accepts. Automaton has 31253 states and 128756 transitions. Word has length 170 [2022-02-10 22:38:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:32,719 INFO L470 AbstractCegarLoop]: Abstraction has 31253 states and 128756 transitions. [2022-02-10 22:38:32,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.088235294117647) internal successors, (343), 34 states have internal predecessors, (343), 0 states have call successors, (0), 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-02-10 22:38:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31253 states and 128756 transitions. [2022-02-10 22:38:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:32,787 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:32,787 INFO L515 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-02-10 22:38:32,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:32,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-02-10 22:38:32,988 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash -706640369, now seen corresponding path program 6 times [2022-02-10 22:38:32,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:32,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017628427] [2022-02-10 22:38:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:33,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:33,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017628427] [2022-02-10 22:38:33,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017628427] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:33,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598555261] [2022-02-10 22:38:33,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:38:33,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:33,248 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:33,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-10 22:38:33,418 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:38:33,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:33,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 22:38:33,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:33,934 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-02-10 22:38:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:34,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:34,243 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:34,243 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 26 treesize of output 27 [2022-02-10 22:38:34,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:34,256 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 25 treesize of output 26 [2022-02-10 22:38:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:34,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598555261] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:34,458 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:34,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 23 [2022-02-10 22:38:34,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262034366] [2022-02-10 22:38:34,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:34,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-10 22:38:34,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:34,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-10 22:38:34,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-02-10 22:38:34,460 INFO L87 Difference]: Start difference. First operand 31253 states and 128756 transitions. Second operand has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 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-02-10 22:38:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:35,591 INFO L93 Difference]: Finished difference Result 52538 states and 220391 transitions. [2022-02-10 22:38:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 22:38:35,591 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 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-02-10 22:38:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:35,812 INFO L225 Difference]: With dead ends: 52538 [2022-02-10 22:38:35,812 INFO L226 Difference]: Without dead ends: 49217 [2022-02-10 22:38:35,812 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-02-10 22:38:35,813 INFO L934 BasicCegarLoop]: 254 mSDtfsCounter, 767 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:35,813 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [767 Valid, 2796 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 885 Invalid, 0 Unknown, 26 Unchecked, 0.3s Time] [2022-02-10 22:38:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49217 states. [2022-02-10 22:38:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49217 to 32733. [2022-02-10 22:38:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 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-02-10 22:38:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-02-10 22:38:36,914 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-02-10 22:38:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:36,915 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-02-10 22:38:36,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 0 states have call successors, (0), 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-02-10 22:38:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-02-10 22:38:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:37,283 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:37,283 INFO L515 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-02-10 22:38:37,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-02-10 22:38:37,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:37,496 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1845040171, now seen corresponding path program 7 times [2022-02-10 22:38:37,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:37,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607349787] [2022-02-10 22:38:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:37,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:37,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607349787] [2022-02-10 22:38:37,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607349787] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:37,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491257397] [2022-02-10 22:38:37,717 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:38:37,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:37,718 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:37,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-10 22:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:37,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 22:38:37,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:38,171 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 7 [2022-02-10 22:38:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:38:38,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:38,476 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:38,476 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 26 treesize of output 27 [2022-02-10 22:38:38,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:38:38,487 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:38,487 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 25 treesize of output 12 [2022-02-10 22:38:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:38,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491257397] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:38,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:38,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-02-10 22:38:38,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886605279] [2022-02-10 22:38:38,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:38,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-10 22:38:38,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-10 22:38:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-02-10 22:38:38,680 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:38:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:39,931 INFO L93 Difference]: Finished difference Result 50734 states and 213030 transitions. [2022-02-10 22:38:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 22:38:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:38:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:40,120 INFO L225 Difference]: With dead ends: 50734 [2022-02-10 22:38:40,120 INFO L226 Difference]: Without dead ends: 47413 [2022-02-10 22:38:40,121 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2022-02-10 22:38:40,121 INFO L934 BasicCegarLoop]: 247 mSDtfsCounter, 650 mSDsluCounter, 4231 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:40,121 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 3987 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 22:38:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47413 states. [2022-02-10 22:38:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47413 to 32841. [2022-02-10 22:38:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32841 states, 32840 states have (on average 4.125669914738125) internal successors, (135487), 32840 states have internal predecessors, (135487), 0 states have call successors, (0), 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-02-10 22:38:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32841 states to 32841 states and 135487 transitions. [2022-02-10 22:38:41,471 INFO L78 Accepts]: Start accepts. Automaton has 32841 states and 135487 transitions. Word has length 170 [2022-02-10 22:38:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:41,472 INFO L470 AbstractCegarLoop]: Abstraction has 32841 states and 135487 transitions. [2022-02-10 22:38:41,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.708333333333334) internal successors, (233), 24 states have internal predecessors, (233), 0 states have call successors, (0), 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-02-10 22:38:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32841 states and 135487 transitions. [2022-02-10 22:38:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:41,553 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:41,553 INFO L515 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-02-10 22:38:41,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:41,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-10 22:38:41,755 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 965858141, now seen corresponding path program 8 times [2022-02-10 22:38:41,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:41,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161265955] [2022-02-10 22:38:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:41,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:41,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:41,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161265955] [2022-02-10 22:38:41,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161265955] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:41,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249641042] [2022-02-10 22:38:41,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:38:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:41,996 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:41,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-10 22:38:42,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:38:42,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:42,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 22:38:42,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:42,411 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 7 [2022-02-10 22:38:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:42,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:42,745 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:42,745 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 25 treesize of output 26 [2022-02-10 22:38:42,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:42,759 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 26 treesize of output 27 [2022-02-10 22:38:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:42,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249641042] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:42,964 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:42,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-02-10 22:38:42,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318393722] [2022-02-10 22:38:42,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:42,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 22:38:42,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:42,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 22:38:42,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-02-10 22:38:42,965 INFO L87 Difference]: Start difference. First operand 32841 states and 135487 transitions. Second operand has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 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-02-10 22:38:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:44,071 INFO L93 Difference]: Finished difference Result 48666 states and 203919 transitions. [2022-02-10 22:38:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 22:38:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 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-02-10 22:38:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:44,238 INFO L225 Difference]: With dead ends: 48666 [2022-02-10 22:38:44,238 INFO L226 Difference]: Without dead ends: 45645 [2022-02-10 22:38:44,238 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2022-02-10 22:38:44,239 INFO L934 BasicCegarLoop]: 253 mSDtfsCounter, 652 mSDsluCounter, 3471 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:44,239 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 3332 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 914 Invalid, 0 Unknown, 82 Unchecked, 0.4s Time] [2022-02-10 22:38:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45645 states. [2022-02-10 22:38:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45645 to 32733. [2022-02-10 22:38:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 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-02-10 22:38:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-02-10 22:38:45,514 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-02-10 22:38:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:45,514 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-02-10 22:38:45,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.454545454545455) internal successors, (230), 22 states have internal predecessors, (230), 0 states have call successors, (0), 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-02-10 22:38:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-02-10 22:38:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:45,591 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:45,591 INFO L515 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-02-10 22:38:45,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:45,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:45,792 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1992831499, now seen corresponding path program 9 times [2022-02-10 22:38:45,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:45,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603419654] [2022-02-10 22:38:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:46,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:46,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603419654] [2022-02-10 22:38:46,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603419654] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:46,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894179000] [2022-02-10 22:38:46,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:38:46,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:46,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:46,012 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:46,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-10 22:38:46,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:38:46,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:46,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-10 22:38:46,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:46,445 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 7 [2022-02-10 22:38:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:46,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:46,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:46,759 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 26 treesize of output 27 [2022-02-10 22:38:46,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:46,773 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 25 treesize of output 26 [2022-02-10 22:38:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:46,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894179000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:46,978 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:46,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 22 [2022-02-10 22:38:46,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793049390] [2022-02-10 22:38:46,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:46,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-10 22:38:46,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-10 22:38:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2022-02-10 22:38:46,979 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:38:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:48,042 INFO L93 Difference]: Finished difference Result 50914 states and 213893 transitions. [2022-02-10 22:38:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 22:38:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:38:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:48,217 INFO L225 Difference]: With dead ends: 50914 [2022-02-10 22:38:48,217 INFO L226 Difference]: Without dead ends: 47593 [2022-02-10 22:38:48,218 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2022-02-10 22:38:48,218 INFO L934 BasicCegarLoop]: 239 mSDtfsCounter, 573 mSDsluCounter, 3335 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:48,219 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 3185 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1003 Invalid, 0 Unknown, 34 Unchecked, 0.4s Time] [2022-02-10 22:38:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47593 states. [2022-02-10 22:38:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47593 to 33165. [2022-02-10 22:38:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33165 states, 33164 states have (on average 4.128874683391629) internal successors, (136930), 33164 states have internal predecessors, (136930), 0 states have call successors, (0), 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-02-10 22:38:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33165 states to 33165 states and 136930 transitions. [2022-02-10 22:38:49,431 INFO L78 Accepts]: Start accepts. Automaton has 33165 states and 136930 transitions. Word has length 170 [2022-02-10 22:38:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:49,431 INFO L470 AbstractCegarLoop]: Abstraction has 33165 states and 136930 transitions. [2022-02-10 22:38:49,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.318181818181818) internal successors, (227), 22 states have internal predecessors, (227), 0 states have call successors, (0), 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-02-10 22:38:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33165 states and 136930 transitions. [2022-02-10 22:38:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:49,502 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:49,502 INFO L515 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-02-10 22:38:49,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-10 22:38:49,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-02-10 22:38:49,703 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash 508762515, now seen corresponding path program 10 times [2022-02-10 22:38:49,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:49,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537057653] [2022-02-10 22:38:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:49,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:49,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537057653] [2022-02-10 22:38:49,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537057653] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:49,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187097286] [2022-02-10 22:38:49,920 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:38:49,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:49,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:49,921 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:49,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-10 22:38:50,069 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:38:50,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:50,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-10 22:38:50,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:50,343 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 7 [2022-02-10 22:38:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:38:50,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:50,869 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:38:50,869 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 26 treesize of output 27 [2022-02-10 22:38:50,881 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:38:50,881 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 25 treesize of output 12 [2022-02-10 22:38:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:51,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187097286] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:51,073 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:51,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-02-10 22:38:51,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428925777] [2022-02-10 22:38:51,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:51,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-10 22:38:51,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-10 22:38:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-02-10 22:38:51,075 INFO L87 Difference]: Start difference. First operand 33165 states and 136930 transitions. Second operand has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 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-02-10 22:38:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:52,107 INFO L93 Difference]: Finished difference Result 50733 states and 212921 transitions. [2022-02-10 22:38:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 22:38:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 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-02-10 22:38:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:52,507 INFO L225 Difference]: With dead ends: 50733 [2022-02-10 22:38:52,508 INFO L226 Difference]: Without dead ends: 47712 [2022-02-10 22:38:52,508 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 329 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-02-10 22:38:52,508 INFO L934 BasicCegarLoop]: 245 mSDtfsCounter, 652 mSDsluCounter, 4028 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:52,509 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [652 Valid, 3796 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-10 22:38:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47712 states. [2022-02-10 22:38:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47712 to 33057. [2022-02-10 22:38:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33057 states, 33056 states have (on average 4.127813407550823) internal successors, (136449), 33056 states have internal predecessors, (136449), 0 states have call successors, (0), 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-02-10 22:38:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33057 states to 33057 states and 136449 transitions. [2022-02-10 22:38:53,502 INFO L78 Accepts]: Start accepts. Automaton has 33057 states and 136449 transitions. Word has length 170 [2022-02-10 22:38:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:38:53,503 INFO L470 AbstractCegarLoop]: Abstraction has 33057 states and 136449 transitions. [2022-02-10 22:38:53,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 24 states have internal predecessors, (236), 0 states have call successors, (0), 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-02-10 22:38:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33057 states and 136449 transitions. [2022-02-10 22:38:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:38:53,572 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:38:53,572 INFO L515 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-02-10 22:38:53,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-10 22:38:53,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:53,773 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:38:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:38:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1386684303, now seen corresponding path program 11 times [2022-02-10 22:38:53,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:38:53,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53872260] [2022-02-10 22:38:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:38:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:38:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:38:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:38:54,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:38:54,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53872260] [2022-02-10 22:38:54,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53872260] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:38:54,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548534599] [2022-02-10 22:38:54,317 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:38:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:38:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:38:54,343 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:38:54,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-10 22:38:54,544 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:38:54,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:38:54,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 75 conjunts are in the unsatisfiable core [2022-02-10 22:38:54,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:38:54,909 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 13 treesize of output 9 [2022-02-10 22:38:55,030 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-02-10 22:38:55,161 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-02-10 22:38:55,225 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-02-10 22:38:55,304 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-02-10 22:38:55,444 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 7 [2022-02-10 22:38:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:38:55,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:38:55,857 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (< (select .cse0 (+ c_~X_0~0.offset 4)) (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0)))) (forall ((v_ArrVal_1466 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (<= (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select .cse1 (+ c_~X_0~0.offset 4)))))) is different from false [2022-02-10 22:38:55,910 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (< (select .cse0 (+ c_~X_0~0.offset 4)) (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0)))) (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (<= (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select .cse1 (+ c_~X_0~0.offset 4)))))) is different from false [2022-02-10 22:38:55,946 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1464) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (<= (+ (select .cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (select .cse0 (+ c_~X_0~0.offset 4))))) (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1464) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1466) c_~X_0~0.base))) (< (select .cse1 (+ c_~X_0~0.offset 4)) (+ (select .cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0))))) is different from false [2022-02-10 22:38:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:38:56,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548534599] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:38:56,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:38:56,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 13] total 43 [2022-02-10 22:38:56,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950470683] [2022-02-10 22:38:56,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:38:56,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-10 22:38:56,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:38:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-10 22:38:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1428, Unknown=3, NotChecked=234, Total=1806 [2022-02-10 22:38:56,045 INFO L87 Difference]: Start difference. First operand 33057 states and 136449 transitions. Second operand has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 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-02-10 22:38:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:38:58,752 INFO L93 Difference]: Finished difference Result 54391 states and 228757 transitions. [2022-02-10 22:38:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-10 22:38:58,752 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 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-02-10 22:38:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:38:59,129 INFO L225 Difference]: With dead ends: 54391 [2022-02-10 22:38:59,129 INFO L226 Difference]: Without dead ends: 51370 [2022-02-10 22:38:59,129 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 313 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=680, Invalid=4159, Unknown=3, NotChecked=414, Total=5256 [2022-02-10 22:38:59,130 INFO L934 BasicCegarLoop]: 261 mSDtfsCounter, 1476 mSDsluCounter, 5819 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1045 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:38:59,130 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1476 Valid, 5267 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2760 Invalid, 0 Unknown, 1045 Unchecked, 1.0s Time] [2022-02-10 22:38:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51370 states. [2022-02-10 22:39:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51370 to 32733. [2022-02-10 22:39:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32733 states, 32732 states have (on average 4.124587559574728) internal successors, (135006), 32732 states have internal predecessors, (135006), 0 states have call successors, (0), 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-02-10 22:39:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32733 states to 32733 states and 135006 transitions. [2022-02-10 22:39:00,239 INFO L78 Accepts]: Start accepts. Automaton has 32733 states and 135006 transitions. Word has length 170 [2022-02-10 22:39:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:00,239 INFO L470 AbstractCegarLoop]: Abstraction has 32733 states and 135006 transitions. [2022-02-10 22:39:00,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 7.8604651162790695) internal successors, (338), 43 states have internal predecessors, (338), 0 states have call successors, (0), 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-02-10 22:39:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32733 states and 135006 transitions. [2022-02-10 22:39:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:00,312 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:00,312 INFO L515 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-02-10 22:39:00,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-02-10 22:39:00,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:00,521 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1124442827, now seen corresponding path program 12 times [2022-02-10 22:39:00,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:00,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177278564] [2022-02-10 22:39:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:00,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:00,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177278564] [2022-02-10 22:39:00,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177278564] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:00,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95399993] [2022-02-10 22:39:00,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:39:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:00,866 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:00,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-10 22:39:01,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:39:01,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:39:01,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-10 22:39:01,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:01,898 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-02-10 22:39:01,941 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-02-10 22:39:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:39:02,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:02,274 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1515 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1515) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1515 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1515) 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-02-10 22:39:02,281 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1515 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1515) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1515 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1515) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:39:02,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:02,289 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 58 treesize of output 49 [2022-02-10 22:39:02,292 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 18 treesize of output 11 [2022-02-10 22:39:02,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:39:02,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:02,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-02-10 22:39:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:02,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95399993] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:02,693 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:02,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 42 [2022-02-10 22:39:02,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64639664] [2022-02-10 22:39:02,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:02,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 22:39:02,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 22:39:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1416, Unknown=2, NotChecked=154, Total=1722 [2022-02-10 22:39:02,694 INFO L87 Difference]: Start difference. First operand 32733 states and 135006 transitions. Second operand has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:39:04,707 INFO L93 Difference]: Finished difference Result 57589 states and 242558 transitions. [2022-02-10 22:39:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-10 22:39:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:39:04,911 INFO L225 Difference]: With dead ends: 57589 [2022-02-10 22:39:04,911 INFO L226 Difference]: Without dead ends: 54268 [2022-02-10 22:39:04,911 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=3257, Unknown=2, NotChecked=242, Total=4032 [2022-02-10 22:39:04,911 INFO L934 BasicCegarLoop]: 259 mSDtfsCounter, 1211 mSDsluCounter, 5711 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:39:04,912 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1211 Valid, 5318 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1993 Invalid, 0 Unknown, 523 Unchecked, 0.7s Time] [2022-02-10 22:39:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54268 states. [2022-02-10 22:39:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54268 to 33441. [2022-02-10 22:39:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33441 states, 33440 states have (on average 4.128977272727273) internal successors, (138073), 33440 states have internal predecessors, (138073), 0 states have call successors, (0), 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-02-10 22:39:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33441 states to 33441 states and 138073 transitions. [2022-02-10 22:39:06,239 INFO L78 Accepts]: Start accepts. Automaton has 33441 states and 138073 transitions. Word has length 170 [2022-02-10 22:39:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:06,239 INFO L470 AbstractCegarLoop]: Abstraction has 33441 states and 138073 transitions. [2022-02-10 22:39:06,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33441 states and 138073 transitions. [2022-02-10 22:39:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:06,324 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:06,324 INFO L515 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-02-10 22:39:06,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-02-10 22:39:06,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:06,527 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1054585315, now seen corresponding path program 13 times [2022-02-10 22:39:06,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:06,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675989300] [2022-02-10 22:39:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:06,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:06,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675989300] [2022-02-10 22:39:06,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675989300] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:06,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786527300] [2022-02-10 22:39:06,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:39:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:06,856 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:06,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-02-10 22:39:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:07,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-10 22:39:07,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:07,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:07,537 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 16 treesize of output 18 [2022-02-10 22:39:07,817 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-02-10 22:39:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:39:07,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:08,181 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1564 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1564) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1564 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1564) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:39:08,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:08,190 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 60 treesize of output 51 [2022-02-10 22:39:08,193 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 19 treesize of output 12 [2022-02-10 22:39:08,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:39:08,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:08,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-02-10 22:39:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:08,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786527300] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:08,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:08,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 17] total 41 [2022-02-10 22:39:08,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854942367] [2022-02-10 22:39:08,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:08,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 22:39:08,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 22:39:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1418, Unknown=1, NotChecked=76, Total=1640 [2022-02-10 22:39:08,605 INFO L87 Difference]: Start difference. First operand 33441 states and 138073 transitions. Second operand has 41 states, 41 states have (on average 6.804878048780488) internal successors, (279), 41 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:39:10,407 INFO L93 Difference]: Finished difference Result 57545 states and 242450 transitions. [2022-02-10 22:39:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-10 22:39:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.804878048780488) internal successors, (279), 41 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:39:10,618 INFO L225 Difference]: With dead ends: 57545 [2022-02-10 22:39:10,618 INFO L226 Difference]: Without dead ends: 54224 [2022-02-10 22:39:10,619 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 313 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=3167, Unknown=1, NotChecked=118, Total=3782 [2022-02-10 22:39:10,619 INFO L934 BasicCegarLoop]: 261 mSDtfsCounter, 1186 mSDsluCounter, 4931 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 4627 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:39:10,619 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 4627 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1867 Invalid, 0 Unknown, 388 Unchecked, 0.7s Time] [2022-02-10 22:39:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54224 states. [2022-02-10 22:39:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54224 to 33289. [2022-02-10 22:39:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33289 states, 33288 states have (on average 4.126502042778179) internal successors, (137363), 33288 states have internal predecessors, (137363), 0 states have call successors, (0), 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-02-10 22:39:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 137363 transitions. [2022-02-10 22:39:11,912 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 137363 transitions. Word has length 170 [2022-02-10 22:39:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:11,912 INFO L470 AbstractCegarLoop]: Abstraction has 33289 states and 137363 transitions. [2022-02-10 22:39:11,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.804878048780488) internal successors, (279), 41 states have internal predecessors, (279), 0 states have call successors, (0), 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-02-10 22:39:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 137363 transitions. [2022-02-10 22:39:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:11,984 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:11,985 INFO L515 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-02-10 22:39:12,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-02-10 22:39:12,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-02-10 22:39:12,186 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 49466847, now seen corresponding path program 14 times [2022-02-10 22:39:12,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:12,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030542059] [2022-02-10 22:39:12,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:12,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:12,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030542059] [2022-02-10 22:39:12,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030542059] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:12,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957370407] [2022-02-10 22:39:12,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:39:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:12,479 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:12,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-10 22:39:12,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:39:12,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:39:12,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-10 22:39:12,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:13,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:13,145 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 16 treesize of output 18 [2022-02-10 22:39:13,196 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 7 [2022-02-10 22:39:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:13,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:13,751 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1613 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1613) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_1613 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1613) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:39:13,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:13,759 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 60 treesize of output 51 [2022-02-10 22:39:13,763 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 19 treesize of output 12 [2022-02-10 22:39:13,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:39:13,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:13,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-02-10 22:39:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:14,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957370407] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:14,395 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:14,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 52 [2022-02-10 22:39:14,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892239940] [2022-02-10 22:39:14,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:14,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-02-10 22:39:14,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-02-10 22:39:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2312, Unknown=1, NotChecked=98, Total=2652 [2022-02-10 22:39:14,397 INFO L87 Difference]: Start difference. First operand 33289 states and 137363 transitions. Second operand has 52 states, 52 states have (on average 5.5) internal successors, (286), 52 states have internal predecessors, (286), 0 states have call successors, (0), 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-02-10 22:39:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:39:18,231 INFO L93 Difference]: Finished difference Result 114991 states and 484791 transitions. [2022-02-10 22:39:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-10 22:39:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.5) internal successors, (286), 52 states have internal predecessors, (286), 0 states have call successors, (0), 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-02-10 22:39:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:39:18,762 INFO L225 Difference]: With dead ends: 114991 [2022-02-10 22:39:18,762 INFO L226 Difference]: Without dead ends: 108349 [2022-02-10 22:39:18,763 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1464, Invalid=7659, Unknown=1, NotChecked=188, Total=9312 [2022-02-10 22:39:18,763 INFO L934 BasicCegarLoop]: 266 mSDtfsCounter, 4219 mSDsluCounter, 5686 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 508 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-10 22:39:18,763 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4219 Valid, 5192 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2138 Invalid, 0 Unknown, 508 Unchecked, 0.9s Time] [2022-02-10 22:39:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108349 states. [2022-02-10 22:39:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108349 to 33397. [2022-02-10 22:39:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33397 states, 33396 states have (on average 4.127560186848725) internal successors, (137844), 33396 states have internal predecessors, (137844), 0 states have call successors, (0), 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-02-10 22:39:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33397 states to 33397 states and 137844 transitions. [2022-02-10 22:39:21,024 INFO L78 Accepts]: Start accepts. Automaton has 33397 states and 137844 transitions. Word has length 170 [2022-02-10 22:39:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:21,025 INFO L470 AbstractCegarLoop]: Abstraction has 33397 states and 137844 transitions. [2022-02-10 22:39:21,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.5) internal successors, (286), 52 states have internal predecessors, (286), 0 states have call successors, (0), 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-02-10 22:39:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 33397 states and 137844 transitions. [2022-02-10 22:39:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:21,109 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:21,110 INFO L515 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-02-10 22:39:21,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-02-10 22:39:21,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-02-10 22:39:21,310 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 998566901, now seen corresponding path program 15 times [2022-02-10 22:39:21,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:21,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410570111] [2022-02-10 22:39:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:21,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:21,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410570111] [2022-02-10 22:39:21,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410570111] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:21,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093355645] [2022-02-10 22:39:21,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:39:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:21,620 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:21,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-02-10 22:39:22,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-10 22:39:22,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:39:22,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-10 22:39:22,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:22,165 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-02-10 22:39:22,488 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 22:39:22,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-10 22:39:22,516 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:39:22,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:39:22,795 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 18 treesize of output 20 [2022-02-10 22:39:22,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:22,908 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 23 treesize of output 23 [2022-02-10 22:39:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:23,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:23,948 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:23,948 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 115 treesize of output 81 [2022-02-10 22:39:23,953 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 63 treesize of output 57 [2022-02-10 22:39:23,956 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 57 treesize of output 51 [2022-02-10 22:39:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:25,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093355645] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:25,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:25,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26, 24] total 56 [2022-02-10 22:39:25,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722654926] [2022-02-10 22:39:25,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:25,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-02-10 22:39:25,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-02-10 22:39:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2829, Unknown=8, NotChecked=0, Total=3080 [2022-02-10 22:39:25,211 INFO L87 Difference]: Start difference. First operand 33397 states and 137844 transitions. Second operand has 56 states, 56 states have (on average 5.571428571428571) internal successors, (312), 56 states have internal predecessors, (312), 0 states have call successors, (0), 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-02-10 22:39:31,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:39:31,473 INFO L93 Difference]: Finished difference Result 122757 states and 512414 transitions. [2022-02-10 22:39:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-02-10 22:39:31,473 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.571428571428571) internal successors, (312), 56 states have internal predecessors, (312), 0 states have call successors, (0), 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-02-10 22:39:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:39:32,338 INFO L225 Difference]: With dead ends: 122757 [2022-02-10 22:39:32,338 INFO L226 Difference]: Without dead ends: 116737 [2022-02-10 22:39:32,339 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 302 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2061, Invalid=13431, Unknown=8, NotChecked=0, Total=15500 [2022-02-10 22:39:32,339 INFO L934 BasicCegarLoop]: 272 mSDtfsCounter, 4089 mSDsluCounter, 7819 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 7035 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:39:32,339 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4089 Valid, 7035 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3210 Invalid, 0 Unknown, 531 Unchecked, 1.4s Time] [2022-02-10 22:39:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116737 states. [2022-02-10 22:39:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116737 to 34012. [2022-02-10 22:39:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34012 states, 34011 states have (on average 4.117197377319103) internal successors, (140030), 34011 states have internal predecessors, (140030), 0 states have call successors, (0), 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-02-10 22:39:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34012 states to 34012 states and 140030 transitions. [2022-02-10 22:39:34,256 INFO L78 Accepts]: Start accepts. Automaton has 34012 states and 140030 transitions. Word has length 170 [2022-02-10 22:39:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:34,256 INFO L470 AbstractCegarLoop]: Abstraction has 34012 states and 140030 transitions. [2022-02-10 22:39:34,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.571428571428571) internal successors, (312), 56 states have internal predecessors, (312), 0 states have call successors, (0), 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-02-10 22:39:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34012 states and 140030 transitions. [2022-02-10 22:39:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:34,329 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:34,329 INFO L515 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-02-10 22:39:34,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-02-10 22:39:34,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:34,530 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash -203177157, now seen corresponding path program 13 times [2022-02-10 22:39:34,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:34,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991732552] [2022-02-10 22:39:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:39:34,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:34,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991732552] [2022-02-10 22:39:34,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991732552] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:34,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805883807] [2022-02-10 22:39:34,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:39:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:34,941 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-02-10 22:39:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:35,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-10 22:39:35,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:35,167 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-02-10 22:39:35,263 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 22:39:35,264 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-02-10 22:39:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:36,036 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-10 22:39:36,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-02-10 22:39:36,089 INFO L353 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-02-10 22:39:36,090 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 22 treesize of output 28 [2022-02-10 22:39:36,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-10 22:39:36,428 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-02-10 22:39:36,499 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-02-10 22:39:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:39:36,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:36,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1717) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:39:36,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1716) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1717) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:39:36,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1717 (Array Int Int)) (v_ArrVal_1716 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1716) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1717) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-02-10 22:39:36,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:36,843 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 242 treesize of output 173 [2022-02-10 22:39:36,846 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 158 treesize of output 142 [2022-02-10 22:39:36,849 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 75 treesize of output 67 [2022-02-10 22:39:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:39:42,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805883807] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:42,122 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:42,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 20] total 49 [2022-02-10 22:39:42,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148661372] [2022-02-10 22:39:42,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:42,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-10 22:39:42,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-10 22:39:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1919, Unknown=4, NotChecked=270, Total=2352 [2022-02-10 22:39:42,125 INFO L87 Difference]: Start difference. First operand 34012 states and 140030 transitions. Second operand has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 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-02-10 22:39:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:39:47,163 INFO L93 Difference]: Finished difference Result 147061 states and 631684 transitions. [2022-02-10 22:39:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-10 22:39:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 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-02-10 22:39:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:39:47,962 INFO L225 Difference]: With dead ends: 147061 [2022-02-10 22:39:47,963 INFO L226 Difference]: Without dead ends: 145260 [2022-02-10 22:39:47,963 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 307 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=806, Invalid=7034, Unknown=4, NotChecked=528, Total=8372 [2022-02-10 22:39:47,963 INFO L934 BasicCegarLoop]: 331 mSDtfsCounter, 2161 mSDsluCounter, 10170 mSDsCounter, 0 mSdLazyCounter, 3280 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 8962 SdHoareTripleChecker+Invalid, 6500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3079 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:39:47,964 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 8962 Invalid, 6500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3280 Invalid, 0 Unknown, 3079 Unchecked, 1.5s Time] [2022-02-10 22:39:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145260 states. [2022-02-10 22:39:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145260 to 34882. [2022-02-10 22:39:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34882 states, 34881 states have (on average 4.116596427854706) internal successors, (143591), 34881 states have internal predecessors, (143591), 0 states have call successors, (0), 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-02-10 22:39:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34882 states to 34882 states and 143591 transitions. [2022-02-10 22:39:50,821 INFO L78 Accepts]: Start accepts. Automaton has 34882 states and 143591 transitions. Word has length 170 [2022-02-10 22:39:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:39:50,822 INFO L470 AbstractCegarLoop]: Abstraction has 34882 states and 143591 transitions. [2022-02-10 22:39:50,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.877551020408164) internal successors, (386), 49 states have internal predecessors, (386), 0 states have call successors, (0), 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-02-10 22:39:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34882 states and 143591 transitions. [2022-02-10 22:39:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:39:50,904 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:39:50,904 INFO L515 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-02-10 22:39:50,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-02-10 22:39:51,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-02-10 22:39:51,105 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:39:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:39:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1163544705, now seen corresponding path program 14 times [2022-02-10 22:39:51,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:39:51,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695998326] [2022-02-10 22:39:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:39:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:39:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:39:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:52,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:39:52,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695998326] [2022-02-10 22:39:52,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695998326] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:39:52,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303877295] [2022-02-10 22:39:52,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:39:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:39:52,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:39:52,243 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:39:52,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-02-10 22:39:52,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:39:52,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:39:52,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-10 22:39:52,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:39:53,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:53,310 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-02-10 22:39:53,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:53,409 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-02-10 22:39:53,512 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-02-10 22:39:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:39:53,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:39:53,891 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1767 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_1767 (Array Int Int))) (<= c_~s_2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:39:53,952 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ 1 c_~s_2~0)))) is different from false [2022-02-10 22:39:53,964 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1767) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:39:53,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:39:53,975 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 226 treesize of output 157 [2022-02-10 22:39:53,980 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 71 treesize of output 63 [2022-02-10 22:39:53,983 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 134 treesize of output 118 [2022-02-10 22:39:54,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:39:54,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:39:54,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:39:54,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 3 [2022-02-10 22:39:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-10 22:39:55,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303877295] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:39:55,094 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:39:55,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 28] total 67 [2022-02-10 22:39:55,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011353729] [2022-02-10 22:39:55,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:39:55,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-02-10 22:39:55,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:39:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-02-10 22:39:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3731, Unknown=3, NotChecked=378, Total=4422 [2022-02-10 22:39:55,189 INFO L87 Difference]: Start difference. First operand 34882 states and 143591 transitions. Second operand has 67 states, 67 states have (on average 5.985074626865671) internal successors, (401), 67 states have internal predecessors, (401), 0 states have call successors, (0), 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-02-10 22:40:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:40:09,032 INFO L93 Difference]: Finished difference Result 260461 states and 1103975 transitions. [2022-02-10 22:40:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-02-10 22:40:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 5.985074626865671) internal successors, (401), 67 states have internal predecessors, (401), 0 states have call successors, (0), 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-02-10 22:40:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:40:11,155 INFO L225 Difference]: With dead ends: 260461 [2022-02-10 22:40:11,155 INFO L226 Difference]: Without dead ends: 252536 [2022-02-10 22:40:11,157 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 316 SyntacticMatches, 11 SemanticMatches, 174 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 8342 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=4111, Invalid=25654, Unknown=3, NotChecked=1032, Total=30800 [2022-02-10 22:40:11,157 INFO L934 BasicCegarLoop]: 366 mSDtfsCounter, 6843 mSDsluCounter, 15661 mSDsCounter, 0 mSdLazyCounter, 6881 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6843 SdHoareTripleChecker+Valid, 13642 SdHoareTripleChecker+Invalid, 9401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 6881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2115 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:40:11,158 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6843 Valid, 13642 Invalid, 9401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 6881 Invalid, 0 Unknown, 2115 Unchecked, 3.1s Time] [2022-02-10 22:40:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252536 states. [2022-02-10 22:40:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252536 to 41639. [2022-02-10 22:40:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41639 states, 41638 states have (on average 4.146044478601278) internal successors, (172633), 41638 states have internal predecessors, (172633), 0 states have call successors, (0), 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-02-10 22:40:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41639 states to 41639 states and 172633 transitions. [2022-02-10 22:40:16,293 INFO L78 Accepts]: Start accepts. Automaton has 41639 states and 172633 transitions. Word has length 170 [2022-02-10 22:40:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:40:16,293 INFO L470 AbstractCegarLoop]: Abstraction has 41639 states and 172633 transitions. [2022-02-10 22:40:16,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 5.985074626865671) internal successors, (401), 67 states have internal predecessors, (401), 0 states have call successors, (0), 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-02-10 22:40:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 41639 states and 172633 transitions. [2022-02-10 22:40:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:40:16,404 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:40:16,404 INFO L515 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-02-10 22:40:16,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-02-10 22:40:16,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-02-10 22:40:16,605 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:40:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:40:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash -115158401, now seen corresponding path program 15 times [2022-02-10 22:40:16,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:40:16,606 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2915646] [2022-02-10 22:40:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:40:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:40:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:17,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:40:17,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2915646] [2022-02-10 22:40:17,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2915646] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:40:17,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078502062] [2022-02-10 22:40:17,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:40:17,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:17,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:40:17,040 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:40:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-10 22:40:17,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:40:17,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:40:17,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-10 22:40:17,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:40:17,239 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-02-10 22:40:17,322 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:40:17,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:40:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:17,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-10 22:40:17,756 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-02-10 22:40:17,844 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-02-10 22:40:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:17,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:40:18,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1818) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:40:18,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1818) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-02-10 22:40:18,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1818) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-02-10 22:40:18,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:40:18,687 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 242 treesize of output 173 [2022-02-10 22:40:18,710 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 158 treesize of output 142 [2022-02-10 22:40:18,713 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 142 treesize of output 134 [2022-02-10 22:40:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:40:19,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078502062] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:40:19,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:40:19,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 42 [2022-02-10 22:40:19,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974385772] [2022-02-10 22:40:19,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:40:19,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 22:40:19,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:40:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 22:40:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1365, Unknown=3, NotChecked=228, Total=1722 [2022-02-10 22:40:19,372 INFO L87 Difference]: Start difference. First operand 41639 states and 172633 transitions. Second operand has 42 states, 42 states have (on average 7.738095238095238) internal successors, (325), 42 states have internal predecessors, (325), 0 states have call successors, (0), 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-02-10 22:40:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:40:23,850 INFO L93 Difference]: Finished difference Result 158398 states and 689709 transitions. [2022-02-10 22:40:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-02-10 22:40:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 7.738095238095238) internal successors, (325), 42 states have internal predecessors, (325), 0 states have call successors, (0), 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-02-10 22:40:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:40:24,806 INFO L225 Difference]: With dead ends: 158398 [2022-02-10 22:40:24,806 INFO L226 Difference]: Without dead ends: 154097 [2022-02-10 22:40:24,807 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 321 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=736, Invalid=5753, Unknown=3, NotChecked=480, Total=6972 [2022-02-10 22:40:24,807 INFO L934 BasicCegarLoop]: 335 mSDtfsCounter, 2579 mSDsluCounter, 6873 mSDsCounter, 0 mSdLazyCounter, 2739 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 6306 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 2739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2147 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:40:24,807 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2579 Valid, 6306 Invalid, 5080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [194 Valid, 2739 Invalid, 0 Unknown, 2147 Unchecked, 1.5s Time] [2022-02-10 22:40:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154097 states. [2022-02-10 22:40:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154097 to 44651. [2022-02-10 22:40:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44651 states, 44650 states have (on average 4.168241881298992) internal successors, (186112), 44650 states have internal predecessors, (186112), 0 states have call successors, (0), 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-02-10 22:40:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44651 states to 44651 states and 186112 transitions. [2022-02-10 22:40:27,988 INFO L78 Accepts]: Start accepts. Automaton has 44651 states and 186112 transitions. Word has length 170 [2022-02-10 22:40:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:40:27,988 INFO L470 AbstractCegarLoop]: Abstraction has 44651 states and 186112 transitions. [2022-02-10 22:40:27,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.738095238095238) internal successors, (325), 42 states have internal predecessors, (325), 0 states have call successors, (0), 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-02-10 22:40:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44651 states and 186112 transitions. [2022-02-10 22:40:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:40:28,553 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:40:28,553 INFO L515 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-02-10 22:40:28,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-02-10 22:40:28,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-02-10 22:40:28,761 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:40:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:40:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash -746354173, now seen corresponding path program 16 times [2022-02-10 22:40:28,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:40:28,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645627522] [2022-02-10 22:40:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:40:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:40:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:29,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:40:29,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645627522] [2022-02-10 22:40:29,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645627522] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:40:29,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651248398] [2022-02-10 22:40:29,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:40:29,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:40:29,168 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:40:29,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-02-10 22:40:29,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:40:29,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:40:29,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-10 22:40:29,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:40:29,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:29,899 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-02-10 22:40:29,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:29,976 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-02-10 22:40:30,054 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-02-10 22:40:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:40:30,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:40:30,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int))) (= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1868) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (- 1)) c_~s_2~0) 0)) is different from false [2022-02-10 22:40:30,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1867 (Array Int Int))) (= 0 (+ (* (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1867) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1868) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (- 1)) c_~s_2~0))) is different from false [2022-02-10 22:40:30,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1867 (Array Int Int))) (= (+ c_~t_4~0 (* (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1867) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1868) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (- 1)) c_~s_2~0) 0)) is different from false [2022-02-10 22:40:30,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:40:30,436 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 116 treesize of output 89 [2022-02-10 22:40:30,439 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 74 treesize of output 66 [2022-02-10 22:40:30,442 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 34 treesize of output 30 [2022-02-10 22:40:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-02-10 22:40:31,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651248398] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:40:31,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:40:31,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 46 [2022-02-10 22:40:31,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919407463] [2022-02-10 22:40:31,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:40:31,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-10 22:40:31,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:40:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-10 22:40:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1667, Unknown=3, NotChecked=252, Total=2070 [2022-02-10 22:40:31,041 INFO L87 Difference]: Start difference. First operand 44651 states and 186112 transitions. Second operand has 46 states, 46 states have (on average 7.260869565217392) internal successors, (334), 46 states have internal predecessors, (334), 0 states have call successors, (0), 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-02-10 22:40:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:40:35,470 INFO L93 Difference]: Finished difference Result 95952 states and 402959 transitions. [2022-02-10 22:40:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-10 22:40:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 7.260869565217392) internal successors, (334), 46 states have internal predecessors, (334), 0 states have call successors, (0), 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-02-10 22:40:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:40:35,968 INFO L225 Difference]: With dead ends: 95952 [2022-02-10 22:40:35,968 INFO L226 Difference]: Without dead ends: 92871 [2022-02-10 22:40:35,969 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 310 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=810, Invalid=4749, Unknown=3, NotChecked=444, Total=6006 [2022-02-10 22:40:35,969 INFO L934 BasicCegarLoop]: 329 mSDtfsCounter, 2522 mSDsluCounter, 7061 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 6471 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1473 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:40:35,969 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2522 Valid, 6471 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 3131 Invalid, 0 Unknown, 1473 Unchecked, 1.4s Time] [2022-02-10 22:40:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92871 states. [2022-02-10 22:40:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92871 to 34622. [2022-02-10 22:40:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34622 states, 34621 states have (on average 4.11267727679732) internal successors, (142385), 34621 states have internal predecessors, (142385), 0 states have call successors, (0), 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-02-10 22:40:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34622 states to 34622 states and 142385 transitions. [2022-02-10 22:40:38,005 INFO L78 Accepts]: Start accepts. Automaton has 34622 states and 142385 transitions. Word has length 170 [2022-02-10 22:40:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:40:38,005 INFO L470 AbstractCegarLoop]: Abstraction has 34622 states and 142385 transitions. [2022-02-10 22:40:38,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.260869565217392) internal successors, (334), 46 states have internal predecessors, (334), 0 states have call successors, (0), 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-02-10 22:40:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states and 142385 transitions. [2022-02-10 22:40:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:40:38,111 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:40:38,111 INFO L515 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-02-10 22:40:38,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-02-10 22:40:38,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:38,329 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:40:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:40:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -110917851, now seen corresponding path program 17 times [2022-02-10 22:40:38,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:40:38,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118145611] [2022-02-10 22:40:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:40:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:40:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:38,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:40:38,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118145611] [2022-02-10 22:40:38,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118145611] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:40:38,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776379243] [2022-02-10 22:40:38,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:40:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:38,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:40:38,963 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:40:39,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-10 22:40:39,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:40:39,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:40:39,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-10 22:40:39,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:40:40,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:40,219 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 16 treesize of output 18 [2022-02-10 22:40:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:40,308 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 16 treesize of output 18 [2022-02-10 22:40:40,423 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-02-10 22:40:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:40,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:40:40,823 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1918 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1918) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1918 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1918) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:40:40,877 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1917) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1918) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1917) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1918) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:40:40,885 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:40:40,886 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 104 treesize of output 77 [2022-02-10 22:40:40,888 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 62 treesize of output 54 [2022-02-10 22:40:40,890 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 28 treesize of output 24 [2022-02-10 22:40:40,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:40,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:40,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:40,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-02-10 22:40:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:41,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776379243] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:40:41,443 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:40:41,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 45 [2022-02-10 22:40:41,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5617195] [2022-02-10 22:40:41,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:40:41,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-10 22:40:41,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:40:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-10 22:40:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1668, Unknown=2, NotChecked=166, Total=1980 [2022-02-10 22:40:41,445 INFO L87 Difference]: Start difference. First operand 34622 states and 142385 transitions. Second operand has 45 states, 45 states have (on average 8.4) internal successors, (378), 45 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:40:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:40:44,328 INFO L93 Difference]: Finished difference Result 79996 states and 339833 transitions. [2022-02-10 22:40:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-10 22:40:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 8.4) internal successors, (378), 45 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:40:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:40:44,730 INFO L225 Difference]: With dead ends: 79996 [2022-02-10 22:40:44,731 INFO L226 Difference]: Without dead ends: 78195 [2022-02-10 22:40:44,731 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=562, Invalid=3604, Unknown=2, NotChecked=254, Total=4422 [2022-02-10 22:40:44,731 INFO L934 BasicCegarLoop]: 303 mSDtfsCounter, 1517 mSDsluCounter, 7196 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 877 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-10 22:40:44,732 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1517 Valid, 6477 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2344 Invalid, 0 Unknown, 877 Unchecked, 1.2s Time] [2022-02-10 22:40:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78195 states. [2022-02-10 22:40:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78195 to 34766. [2022-02-10 22:40:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34766 states, 34765 states have (on average 4.112900906083705) internal successors, (142985), 34765 states have internal predecessors, (142985), 0 states have call successors, (0), 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-02-10 22:40:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34766 states to 34766 states and 142985 transitions. [2022-02-10 22:40:46,466 INFO L78 Accepts]: Start accepts. Automaton has 34766 states and 142985 transitions. Word has length 170 [2022-02-10 22:40:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:40:46,466 INFO L470 AbstractCegarLoop]: Abstraction has 34766 states and 142985 transitions. [2022-02-10 22:40:46,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.4) internal successors, (378), 45 states have internal predecessors, (378), 0 states have call successors, (0), 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-02-10 22:40:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34766 states and 142985 transitions. [2022-02-10 22:40:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:40:46,546 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:40:46,546 INFO L515 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-02-10 22:40:46,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-02-10 22:40:46,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:46,748 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:40:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:40:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1913599967, now seen corresponding path program 18 times [2022-02-10 22:40:46,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:40:46,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530155079] [2022-02-10 22:40:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:40:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:40:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:47,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:40:47,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530155079] [2022-02-10 22:40:47,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530155079] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:40:47,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244733269] [2022-02-10 22:40:47,125 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:40:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:40:47,127 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:40:47,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-02-10 22:40:47,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:40:47,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:40:47,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-10 22:40:47,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:40:47,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:47,846 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 16 treesize of output 18 [2022-02-10 22:40:47,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:47,933 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 16 treesize of output 18 [2022-02-10 22:40:48,023 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 7 [2022-02-10 22:40:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:40:48,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:40:48,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1968 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1968) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_1968 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1968) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-10 22:40:48,658 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1967) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1968) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1968 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1967) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1968) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:40:48,666 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:40:48,667 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 218 treesize of output 149 [2022-02-10 22:40:48,675 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 67 treesize of output 59 [2022-02-10 22:40:48,678 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 126 treesize of output 110 [2022-02-10 22:40:48,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:48,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:48,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-02-10 22:40:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:49,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244733269] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:40:49,224 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:40:49,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 45 [2022-02-10 22:40:49,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791473190] [2022-02-10 22:40:49,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:40:49,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-10 22:40:49,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:40:49,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-10 22:40:49,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1659, Unknown=2, NotChecked=166, Total=1980 [2022-02-10 22:40:49,226 INFO L87 Difference]: Start difference. First operand 34766 states and 142985 transitions. Second operand has 45 states, 45 states have (on average 7.444444444444445) internal successors, (335), 45 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:40:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:40:52,159 INFO L93 Difference]: Finished difference Result 59072 states and 247165 transitions. [2022-02-10 22:40:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-10 22:40:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.444444444444445) internal successors, (335), 45 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:40:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:40:52,383 INFO L225 Difference]: With dead ends: 59072 [2022-02-10 22:40:52,384 INFO L226 Difference]: Without dead ends: 55991 [2022-02-10 22:40:52,384 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 311 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=705, Invalid=4131, Unknown=2, NotChecked=274, Total=5112 [2022-02-10 22:40:52,384 INFO L934 BasicCegarLoop]: 271 mSDtfsCounter, 1517 mSDsluCounter, 5315 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 4914 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 664 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:40:52,385 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1517 Valid, 4914 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2132 Invalid, 0 Unknown, 664 Unchecked, 1.0s Time] [2022-02-10 22:40:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55991 states. [2022-02-10 22:40:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55991 to 35226. [2022-02-10 22:40:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35226 states, 35225 states have (on average 4.116337828246984) internal successors, (144998), 35225 states have internal predecessors, (144998), 0 states have call successors, (0), 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-02-10 22:40:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35226 states to 35226 states and 144998 transitions. [2022-02-10 22:40:53,789 INFO L78 Accepts]: Start accepts. Automaton has 35226 states and 144998 transitions. Word has length 170 [2022-02-10 22:40:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:40:53,789 INFO L470 AbstractCegarLoop]: Abstraction has 35226 states and 144998 transitions. [2022-02-10 22:40:53,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.444444444444445) internal successors, (335), 45 states have internal predecessors, (335), 0 states have call successors, (0), 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-02-10 22:40:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 35226 states and 144998 transitions. [2022-02-10 22:40:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:40:53,873 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:40:53,874 INFO L515 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-02-10 22:40:53,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-02-10 22:40:54,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-02-10 22:40:54,075 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:40:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:40:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash -98734997, now seen corresponding path program 19 times [2022-02-10 22:40:54,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:40:54,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21209824] [2022-02-10 22:40:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:40:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:40:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:40:55,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:40:55,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21209824] [2022-02-10 22:40:55,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21209824] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:40:55,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959195858] [2022-02-10 22:40:55,081 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:40:55,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:40:55,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:40:55,082 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:40:55,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-02-10 22:40:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:40:55,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-10 22:40:55,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:40:55,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:55,819 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 16 treesize of output 18 [2022-02-10 22:40:55,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:55,912 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 16 treesize of output 18 [2022-02-10 22:40:56,010 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 7 [2022-02-10 22:40:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:40:56,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:40:56,429 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2018 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2018) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0))) (forall ((v_ArrVal_2018 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2018) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-02-10 22:40:56,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2017) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2018) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 c_~s_2~0))) (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2017) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2018) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 1)))) is different from false [2022-02-10 22:40:56,490 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:40:56,491 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 104 treesize of output 77 [2022-02-10 22:40:56,493 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 62 treesize of output 54 [2022-02-10 22:40:56,509 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 28 treesize of output 24 [2022-02-10 22:40:56,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:56,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:40:56,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:40:56,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2022-02-10 22:40:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:40:57,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959195858] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:40:57,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:40:57,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 19] total 54 [2022-02-10 22:40:57,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602136120] [2022-02-10 22:40:57,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:40:57,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-10 22:40:57,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:40:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-10 22:40:57,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2483, Unknown=2, NotChecked=202, Total=2862 [2022-02-10 22:40:57,097 INFO L87 Difference]: Start difference. First operand 35226 states and 144998 transitions. Second operand has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 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-02-10 22:41:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:04,963 INFO L93 Difference]: Finished difference Result 196455 states and 826171 transitions. [2022-02-10 22:41:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-02-10 22:41:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 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-02-10 22:41:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:06,326 INFO L225 Difference]: With dead ends: 196455 [2022-02-10 22:41:06,326 INFO L226 Difference]: Without dead ends: 183171 [2022-02-10 22:41:06,326 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 315 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 3795 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2021, Invalid=12991, Unknown=2, NotChecked=486, Total=15500 [2022-02-10 22:41:06,327 INFO L934 BasicCegarLoop]: 251 mSDtfsCounter, 5287 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 7383 SdHoareTripleChecker+Invalid, 5249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1210 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:06,327 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [5287 Valid, 7383 Invalid, 5249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 3761 Invalid, 0 Unknown, 1210 Unchecked, 1.8s Time] [2022-02-10 22:41:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183171 states. [2022-02-10 22:41:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183171 to 41055. [2022-02-10 22:41:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41055 states, 41054 states have (on average 4.188386028158035) internal successors, (171950), 41054 states have internal predecessors, (171950), 0 states have call successors, (0), 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-02-10 22:41:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41055 states to 41055 states and 171950 transitions. [2022-02-10 22:41:10,418 INFO L78 Accepts]: Start accepts. Automaton has 41055 states and 171950 transitions. Word has length 170 [2022-02-10 22:41:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:10,418 INFO L470 AbstractCegarLoop]: Abstraction has 41055 states and 171950 transitions. [2022-02-10 22:41:10,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 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-02-10 22:41:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 41055 states and 171950 transitions. [2022-02-10 22:41:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:10,519 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:10,519 INFO L515 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-02-10 22:41:10,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-02-10 22:41:10,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-02-10 22:41:10,720 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -450956051, now seen corresponding path program 20 times [2022-02-10 22:41:10,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:10,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679546255] [2022-02-10 22:41:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:11,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:11,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679546255] [2022-02-10 22:41:11,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679546255] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:11,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011967083] [2022-02-10 22:41:11,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:41:11,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:11,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:11,055 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:11,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-02-10 22:41:11,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:41:11,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:41:11,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 78 conjunts are in the unsatisfiable core [2022-02-10 22:41:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:11,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:11,988 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 16 treesize of output 18 [2022-02-10 22:41:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:12,086 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 16 treesize of output 18 [2022-02-10 22:41:12,224 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-02-10 22:41:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:41:12,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:12,997 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2068 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2068) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_2068 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2068) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:41:13,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2067 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2067) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2068) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2067 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2067) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2068) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:41:13,064 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:13,064 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 218 treesize of output 149 [2022-02-10 22:41:13,070 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 134 treesize of output 118 [2022-02-10 22:41:13,075 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 63 treesize of output 55 [2022-02-10 22:41:13,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:13,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:13,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:13,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2022-02-10 22:41:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:41:14,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011967083] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:14,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:14,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 28] total 59 [2022-02-10 22:41:14,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964361784] [2022-02-10 22:41:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:14,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-02-10 22:41:14,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-02-10 22:41:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2903, Unknown=2, NotChecked=222, Total=3422 [2022-02-10 22:41:14,036 INFO L87 Difference]: Start difference. First operand 41055 states and 171950 transitions. Second operand has 59 states, 59 states have (on average 5.745762711864407) internal successors, (339), 59 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:41:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:18,864 INFO L93 Difference]: Finished difference Result 128243 states and 537733 transitions. [2022-02-10 22:41:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-10 22:41:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 5.745762711864407) internal successors, (339), 59 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:41:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:19,533 INFO L225 Difference]: With dead ends: 128243 [2022-02-10 22:41:19,533 INFO L226 Difference]: Without dead ends: 122081 [2022-02-10 22:41:19,534 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 297 SyntacticMatches, 12 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1723, Invalid=8789, Unknown=2, NotChecked=406, Total=10920 [2022-02-10 22:41:19,534 INFO L934 BasicCegarLoop]: 289 mSDtfsCounter, 3209 mSDsluCounter, 7171 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3209 SdHoareTripleChecker+Valid, 6482 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 859 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:19,534 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [3209 Valid, 6482 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 3088 Invalid, 0 Unknown, 859 Unchecked, 1.4s Time] [2022-02-10 22:41:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122081 states. [2022-02-10 22:41:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122081 to 40515. [2022-02-10 22:41:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40515 states, 40514 states have (on average 4.183887051389643) internal successors, (169506), 40514 states have internal predecessors, (169506), 0 states have call successors, (0), 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-02-10 22:41:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40515 states to 40515 states and 169506 transitions. [2022-02-10 22:41:22,291 INFO L78 Accepts]: Start accepts. Automaton has 40515 states and 169506 transitions. Word has length 170 [2022-02-10 22:41:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:22,291 INFO L470 AbstractCegarLoop]: Abstraction has 40515 states and 169506 transitions. [2022-02-10 22:41:22,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 5.745762711864407) internal successors, (339), 59 states have internal predecessors, (339), 0 states have call successors, (0), 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-02-10 22:41:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 40515 states and 169506 transitions. [2022-02-10 22:41:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:22,390 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:22,391 INFO L515 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-02-10 22:41:22,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-02-10 22:41:22,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-02-10 22:41:22,591 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1025610121, now seen corresponding path program 21 times [2022-02-10 22:41:22,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:22,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383368690] [2022-02-10 22:41:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:23,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:41:23,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:23,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383368690] [2022-02-10 22:41:23,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383368690] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:23,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887402134] [2022-02-10 22:41:23,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:41:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:23,188 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:23,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-02-10 22:41:23,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:41:23,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:41:23,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-10 22:41:23,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:23,440 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-02-10 22:41:23,583 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 22:41:23,583 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-02-10 22:41:23,590 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:41:23,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:41:23,844 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-02-10 22:41:23,890 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-02-10 22:41:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:24,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:24,508 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2119 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2119) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))))) (forall ((v_ArrVal_2119 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2119) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0)))) is different from false [2022-02-10 22:41:24,521 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2119 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2119) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2119 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2119) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-02-10 22:41:24,529 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:24,529 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 60 treesize of output 51 [2022-02-10 22:41:24,531 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 19 treesize of output 12 [2022-02-10 22:41:24,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:24,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:24,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-02-10 22:41:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:24,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887402134] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:24,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:24,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 17] total 47 [2022-02-10 22:41:24,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917461373] [2022-02-10 22:41:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:24,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-10 22:41:24,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-10 22:41:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1843, Unknown=2, NotChecked=174, Total=2162 [2022-02-10 22:41:24,962 INFO L87 Difference]: Start difference. First operand 40515 states and 169506 transitions. Second operand has 47 states, 47 states have (on average 6.574468085106383) internal successors, (309), 47 states have internal predecessors, (309), 0 states have call successors, (0), 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-02-10 22:41:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:28,661 INFO L93 Difference]: Finished difference Result 66294 states and 280852 transitions. [2022-02-10 22:41:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-10 22:41:28,661 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 6.574468085106383) internal successors, (309), 47 states have internal predecessors, (309), 0 states have call successors, (0), 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-02-10 22:41:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:29,132 INFO L225 Difference]: With dead ends: 66294 [2022-02-10 22:41:29,132 INFO L226 Difference]: Without dead ends: 65768 [2022-02-10 22:41:29,132 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=769, Invalid=5243, Unknown=2, NotChecked=306, Total=6320 [2022-02-10 22:41:29,132 INFO L934 BasicCegarLoop]: 258 mSDtfsCounter, 2307 mSDsluCounter, 5357 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 4899 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:29,133 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2307 Valid, 4899 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2262 Invalid, 0 Unknown, 787 Unchecked, 1.0s Time] [2022-02-10 22:41:29,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65768 states. [2022-02-10 22:41:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65768 to 43488. [2022-02-10 22:41:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43488 states, 43487 states have (on average 4.193529100650769) internal successors, (182364), 43487 states have internal predecessors, (182364), 0 states have call successors, (0), 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-02-10 22:41:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43488 states to 43488 states and 182364 transitions. [2022-02-10 22:41:30,920 INFO L78 Accepts]: Start accepts. Automaton has 43488 states and 182364 transitions. Word has length 170 [2022-02-10 22:41:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:30,920 INFO L470 AbstractCegarLoop]: Abstraction has 43488 states and 182364 transitions. [2022-02-10 22:41:30,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.574468085106383) internal successors, (309), 47 states have internal predecessors, (309), 0 states have call successors, (0), 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-02-10 22:41:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43488 states and 182364 transitions. [2022-02-10 22:41:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:31,031 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:31,031 INFO L515 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-02-10 22:41:31,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-02-10 22:41:31,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-02-10 22:41:31,232 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:31,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1391581945, now seen corresponding path program 22 times [2022-02-10 22:41:31,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:31,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160355662] [2022-02-10 22:41:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:31,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:31,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:31,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160355662] [2022-02-10 22:41:31,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160355662] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:31,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219629870] [2022-02-10 22:41:31,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:41:31,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:31,546 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:31,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-02-10 22:41:31,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:41:31,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:41:31,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-10 22:41:31,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:32,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:32,196 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-02-10 22:41:32,234 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-02-10 22:41:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:41:32,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:32,576 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2168 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2168) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_2168 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2168) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-02-10 22:41:32,588 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2168 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2168) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2168 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2168) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))))) is different from false [2022-02-10 22:41:32,596 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:32,596 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 60 treesize of output 51 [2022-02-10 22:41:32,598 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 19 treesize of output 12 [2022-02-10 22:41:32,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:32,621 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:41:32,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-02-10 22:41:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:33,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219629870] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:33,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:33,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 17] total 41 [2022-02-10 22:41:33,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82180931] [2022-02-10 22:41:33,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:33,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-10 22:41:33,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-10 22:41:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1351, Unknown=2, NotChecked=150, Total=1640 [2022-02-10 22:41:33,272 INFO L87 Difference]: Start difference. First operand 43488 states and 182364 transitions. Second operand has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 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-02-10 22:41:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:35,367 INFO L93 Difference]: Finished difference Result 72959 states and 309025 transitions. [2022-02-10 22:41:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-10 22:41:35,368 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 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-02-10 22:41:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:35,640 INFO L225 Difference]: With dead ends: 72959 [2022-02-10 22:41:35,640 INFO L226 Difference]: Without dead ends: 68603 [2022-02-10 22:41:35,641 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 314 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=555, Invalid=3483, Unknown=2, NotChecked=250, Total=4290 [2022-02-10 22:41:35,641 INFO L934 BasicCegarLoop]: 276 mSDtfsCounter, 1085 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4536 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:35,641 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 4536 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1768 Invalid, 0 Unknown, 502 Unchecked, 0.7s Time] [2022-02-10 22:41:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68603 states. [2022-02-10 22:41:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68603 to 40515. [2022-02-10 22:41:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40515 states, 40514 states have (on average 4.191291899096608) internal successors, (169806), 40514 states have internal predecessors, (169806), 0 states have call successors, (0), 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-02-10 22:41:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40515 states to 40515 states and 169806 transitions. [2022-02-10 22:41:37,179 INFO L78 Accepts]: Start accepts. Automaton has 40515 states and 169806 transitions. Word has length 170 [2022-02-10 22:41:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:37,179 INFO L470 AbstractCegarLoop]: Abstraction has 40515 states and 169806 transitions. [2022-02-10 22:41:37,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.7073170731707314) internal successors, (275), 41 states have internal predecessors, (275), 0 states have call successors, (0), 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-02-10 22:41:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 40515 states and 169806 transitions. [2022-02-10 22:41:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:37,267 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:37,267 INFO L515 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-02-10 22:41:37,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-02-10 22:41:37,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:37,467 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1220438015, now seen corresponding path program 23 times [2022-02-10 22:41:37,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:37,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502050633] [2022-02-10 22:41:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:38,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:38,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502050633] [2022-02-10 22:41:38,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502050633] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:38,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815831073] [2022-02-10 22:41:38,088 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:41:38,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:38,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:38,089 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-02-10 22:41:38,260 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:41:38,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:41:38,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-10 22:41:38,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:38,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:38,701 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 18 treesize of output 20 [2022-02-10 22:41:38,762 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:38,762 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 21 treesize of output 21 [2022-02-10 22:41:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:41:38,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:39,261 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~i_3~0 c_~i_7~0) (and (forall ((v_ArrVal_2217 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2217) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0))) (forall ((v_ArrVal_2217 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2217) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))))))) is different from false [2022-02-10 22:41:39,279 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:39,279 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 115 treesize of output 83 [2022-02-10 22:41:39,282 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 65 treesize of output 58 [2022-02-10 22:41:39,285 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 58 treesize of output 51 [2022-02-10 22:41:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:39,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815831073] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:39,871 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:39,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 44 [2022-02-10 22:41:39,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339391172] [2022-02-10 22:41:39,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:39,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-10 22:41:39,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-10 22:41:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1658, Unknown=1, NotChecked=82, Total=1892 [2022-02-10 22:41:39,872 INFO L87 Difference]: Start difference. First operand 40515 states and 169806 transitions. Second operand has 44 states, 44 states have (on average 6.318181818181818) internal successors, (278), 44 states have internal predecessors, (278), 0 states have call successors, (0), 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-02-10 22:41:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:42,998 INFO L93 Difference]: Finished difference Result 75333 states and 320340 transitions. [2022-02-10 22:41:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-10 22:41:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.318181818181818) internal successors, (278), 44 states have internal predecessors, (278), 0 states have call successors, (0), 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-02-10 22:41:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:43,670 INFO L225 Difference]: With dead ends: 75333 [2022-02-10 22:41:43,671 INFO L226 Difference]: Without dead ends: 72252 [2022-02-10 22:41:43,671 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 315 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=850, Invalid=5159, Unknown=1, NotChecked=152, Total=6162 [2022-02-10 22:41:43,672 INFO L934 BasicCegarLoop]: 316 mSDtfsCounter, 1397 mSDsluCounter, 6336 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 2588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:43,672 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 6021 Invalid, 2588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1996 Invalid, 0 Unknown, 540 Unchecked, 1.0s Time] [2022-02-10 22:41:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72252 states. [2022-02-10 22:41:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72252 to 42149. [2022-02-10 22:41:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42149 states, 42148 states have (on average 4.213035019455253) internal successors, (177571), 42148 states have internal predecessors, (177571), 0 states have call successors, (0), 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-02-10 22:41:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42149 states to 42149 states and 177571 transitions. [2022-02-10 22:41:45,667 INFO L78 Accepts]: Start accepts. Automaton has 42149 states and 177571 transitions. Word has length 170 [2022-02-10 22:41:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:45,667 INFO L470 AbstractCegarLoop]: Abstraction has 42149 states and 177571 transitions. [2022-02-10 22:41:45,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.318181818181818) internal successors, (278), 44 states have internal predecessors, (278), 0 states have call successors, (0), 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-02-10 22:41:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 42149 states and 177571 transitions. [2022-02-10 22:41:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:45,756 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:45,756 INFO L515 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-02-10 22:41:45,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-02-10 22:41:45,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-02-10 22:41:45,957 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash 550415143, now seen corresponding path program 24 times [2022-02-10 22:41:45,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:45,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403930424] [2022-02-10 22:41:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:46,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:46,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403930424] [2022-02-10 22:41:46,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403930424] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:46,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539882962] [2022-02-10 22:41:46,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:41:46,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:46,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:46,284 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-02-10 22:41:46,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:41:46,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:41:46,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 82 conjunts are in the unsatisfiable core [2022-02-10 22:41:46,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:46,613 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-02-10 22:41:46,873 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-10 22:41:46,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-10 22:41:46,899 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:41:46,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:41:47,107 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 16 treesize of output 18 [2022-02-10 22:41:47,154 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 7 [2022-02-10 22:41:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:41:47,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:47,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2268 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2268) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))))) (forall ((v_ArrVal_2268 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2268) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 1 c_~s_2~0)))) is different from false [2022-02-10 22:41:47,815 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:47,815 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 60 treesize of output 51 [2022-02-10 22:41:47,818 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 19 treesize of output 12 [2022-02-10 22:41:47,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:47,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:47,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-02-10 22:41:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:41:48,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539882962] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:48,443 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:48,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 24] total 50 [2022-02-10 22:41:48,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993473137] [2022-02-10 22:41:48,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:48,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-02-10 22:41:48,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-10 22:41:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2144, Unknown=1, NotChecked=94, Total=2450 [2022-02-10 22:41:48,445 INFO L87 Difference]: Start difference. First operand 42149 states and 177571 transitions. Second operand has 50 states, 50 states have (on average 5.46) internal successors, (273), 50 states have internal predecessors, (273), 0 states have call successors, (0), 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-02-10 22:41:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:52,456 INFO L93 Difference]: Finished difference Result 109272 states and 458052 transitions. [2022-02-10 22:41:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-10 22:41:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.46) internal successors, (273), 50 states have internal predecessors, (273), 0 states have call successors, (0), 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-02-10 22:41:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:52,979 INFO L225 Difference]: With dead ends: 109272 [2022-02-10 22:41:52,979 INFO L226 Difference]: Without dead ends: 105311 [2022-02-10 22:41:52,980 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 305 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2091 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1331, Invalid=7784, Unknown=9, NotChecked=188, Total=9312 [2022-02-10 22:41:52,980 INFO L934 BasicCegarLoop]: 289 mSDtfsCounter, 2693 mSDsluCounter, 7974 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2693 SdHoareTripleChecker+Valid, 7269 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:52,981 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2693 Valid, 7269 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2875 Invalid, 0 Unknown, 429 Unchecked, 1.3s Time] [2022-02-10 22:41:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105311 states. [2022-02-10 22:41:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105311 to 41993. [2022-02-10 22:41:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41993 states, 41992 states have (on average 4.20980186702229) internal successors, (176778), 41992 states have internal predecessors, (176778), 0 states have call successors, (0), 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-02-10 22:41:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 176778 transitions. [2022-02-10 22:41:55,204 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 176778 transitions. Word has length 170 [2022-02-10 22:41:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:41:55,204 INFO L470 AbstractCegarLoop]: Abstraction has 41993 states and 176778 transitions. [2022-02-10 22:41:55,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.46) internal successors, (273), 50 states have internal predecessors, (273), 0 states have call successors, (0), 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-02-10 22:41:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 176778 transitions. [2022-02-10 22:41:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:41:55,296 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:41:55,296 INFO L515 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-02-10 22:41:55,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-02-10 22:41:55,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-02-10 22:41:55,497 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:41:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:41:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1685836523, now seen corresponding path program 25 times [2022-02-10 22:41:55,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:41:55,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292707761] [2022-02-10 22:41:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:41:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:41:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:55,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:41:55,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292707761] [2022-02-10 22:41:55,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292707761] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:41:55,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662426919] [2022-02-10 22:41:55,810 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-10 22:41:55,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:41:55,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:41:55,812 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:41:55,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-02-10 22:41:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:41:56,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-10 22:41:56,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:41:56,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:41:56,506 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 16 treesize of output 18 [2022-02-10 22:41:56,557 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 15 treesize of output 7 [2022-02-10 22:41:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:41:56,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:41:57,200 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2317 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2317) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 1))) (forall ((v_ArrVal_2317 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2317) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (+ c_~t_4~0 c_~s_2~0)))) is different from false [2022-02-10 22:41:57,212 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:41:57,212 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 58 treesize of output 49 [2022-02-10 22:41:57,215 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 18 treesize of output 11 [2022-02-10 22:41:57,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:41:57,237 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:41:57,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-02-10 22:41:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:41:57,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662426919] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:41:57,598 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:41:57,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 36 [2022-02-10 22:41:57,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237343733] [2022-02-10 22:41:57,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:41:57,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-10 22:41:57,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:41:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-10 22:41:57,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1066, Unknown=1, NotChecked=66, Total=1260 [2022-02-10 22:41:57,600 INFO L87 Difference]: Start difference. First operand 41993 states and 176778 transitions. Second operand has 36 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 0 states have call successors, (0), 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-02-10 22:41:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:41:59,166 INFO L93 Difference]: Finished difference Result 64663 states and 273964 transitions. [2022-02-10 22:41:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-10 22:41:59,166 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 0 states have call successors, (0), 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-02-10 22:41:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:41:59,431 INFO L225 Difference]: With dead ends: 64663 [2022-02-10 22:41:59,431 INFO L226 Difference]: Without dead ends: 64137 [2022-02-10 22:41:59,431 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 318 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=388, Invalid=2371, Unknown=1, NotChecked=102, Total=2862 [2022-02-10 22:41:59,431 INFO L934 BasicCegarLoop]: 249 mSDtfsCounter, 906 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3717 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:41:59,432 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [906 Valid, 3717 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1244 Invalid, 0 Unknown, 210 Unchecked, 0.5s Time] [2022-02-10 22:41:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64137 states. [2022-02-10 22:42:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64137 to 42737. [2022-02-10 22:42:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42737 states, 42736 states have (on average 4.212958629726694) internal successors, (180045), 42736 states have internal predecessors, (180045), 0 states have call successors, (0), 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-02-10 22:42:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42737 states to 42737 states and 180045 transitions. [2022-02-10 22:42:00,998 INFO L78 Accepts]: Start accepts. Automaton has 42737 states and 180045 transitions. Word has length 170 [2022-02-10 22:42:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:00,998 INFO L470 AbstractCegarLoop]: Abstraction has 42737 states and 180045 transitions. [2022-02-10 22:42:00,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 0 states have call successors, (0), 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-02-10 22:42:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 42737 states and 180045 transitions. [2022-02-10 22:42:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:01,106 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:01,106 INFO L515 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-02-10 22:42:01,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-02-10 22:42:01,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-02-10 22:42:01,307 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash -256498977, now seen corresponding path program 26 times [2022-02-10 22:42:01,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:01,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958176246] [2022-02-10 22:42:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:01,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:01,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958176246] [2022-02-10 22:42:01,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958176246] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:01,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063550793] [2022-02-10 22:42:01,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 22:42:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:01,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:01,909 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:01,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-02-10 22:42:02,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 22:42:02,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:02,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 76 conjunts are in the unsatisfiable core [2022-02-10 22:42:02,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:02,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:02,685 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 16 treesize of output 18 [2022-02-10 22:42:02,733 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 15 treesize of output 7 [2022-02-10 22:42:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:02,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:03,112 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2366 (Array Int Int))) (< (+ c_~t_4~0 c_~s_2~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2366) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) c_~s_6~0 1))) (forall ((v_ArrVal_2366 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2366) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) c_~s_6~0) (+ c_~t_4~0 c_~s_2~0)))) is different from false [2022-02-10 22:42:03,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:03,126 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 60 treesize of output 51 [2022-02-10 22:42:03,130 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 19 treesize of output 12 [2022-02-10 22:42:03,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:03,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-02-10 22:42:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:03,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063550793] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:03,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:03,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 24] total 46 [2022-02-10 22:42:03,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834506778] [2022-02-10 22:42:03,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:03,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-10 22:42:03,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-10 22:42:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1772, Unknown=1, NotChecked=86, Total=2070 [2022-02-10 22:42:03,790 INFO L87 Difference]: Start difference. First operand 42737 states and 180045 transitions. Second operand has 46 states, 46 states have (on average 5.782608695652174) internal successors, (266), 46 states have internal predecessors, (266), 0 states have call successors, (0), 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-02-10 22:42:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:06,826 INFO L93 Difference]: Finished difference Result 113253 states and 475213 transitions. [2022-02-10 22:42:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-10 22:42:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.782608695652174) internal successors, (266), 46 states have internal predecessors, (266), 0 states have call successors, (0), 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-02-10 22:42:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:07,682 INFO L225 Difference]: With dead ends: 113253 [2022-02-10 22:42:07,683 INFO L226 Difference]: Without dead ends: 106251 [2022-02-10 22:42:07,684 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1075, Invalid=5570, Unknown=1, NotChecked=160, Total=6806 [2022-02-10 22:42:07,686 INFO L934 BasicCegarLoop]: 253 mSDtfsCounter, 1806 mSDsluCounter, 5960 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 5522 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:07,686 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1806 Valid, 5522 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2137 Invalid, 0 Unknown, 385 Unchecked, 0.9s Time] [2022-02-10 22:42:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106251 states. [2022-02-10 22:42:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106251 to 41441. [2022-02-10 22:42:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41441 states, 41440 states have (on average 4.202606177606177) internal successors, (174156), 41440 states have internal predecessors, (174156), 0 states have call successors, (0), 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-02-10 22:42:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41441 states to 41441 states and 174156 transitions. [2022-02-10 22:42:09,789 INFO L78 Accepts]: Start accepts. Automaton has 41441 states and 174156 transitions. Word has length 170 [2022-02-10 22:42:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:09,789 INFO L470 AbstractCegarLoop]: Abstraction has 41441 states and 174156 transitions. [2022-02-10 22:42:09,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.782608695652174) internal successors, (266), 46 states have internal predecessors, (266), 0 states have call successors, (0), 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-02-10 22:42:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41441 states and 174156 transitions. [2022-02-10 22:42:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:09,889 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:09,889 INFO L515 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-02-10 22:42:09,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:10,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:10,090 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1945848099, now seen corresponding path program 27 times [2022-02-10 22:42:10,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:10,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915125560] [2022-02-10 22:42:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:10,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:10,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915125560] [2022-02-10 22:42:10,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915125560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:10,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460232478] [2022-02-10 22:42:10,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 22:42:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:10,416 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:10,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-02-10 22:42:10,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-10 22:42:10,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:10,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-10 22:42:10,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:11,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:11,318 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-02-10 22:42:11,344 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-02-10 22:42:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:11,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:11,689 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2415 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2415) 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_2415 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2415) 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-02-10 22:42:11,697 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2415 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2415) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2415 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2415) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:42:11,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:11,706 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 60 treesize of output 51 [2022-02-10 22:42:11,718 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 19 treesize of output 12 [2022-02-10 22:42:11,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:11,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:11,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-02-10 22:42:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:12,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460232478] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:12,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:12,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-02-10 22:42:12,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500448482] [2022-02-10 22:42:12,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:12,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 22:42:12,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 22:42:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1200, Unknown=2, NotChecked=142, Total=1482 [2022-02-10 22:42:12,198 INFO L87 Difference]: Start difference. First operand 41441 states and 174156 transitions. Second operand has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 39 states have internal predecessors, (263), 0 states have call successors, (0), 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-02-10 22:42:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:13,876 INFO L93 Difference]: Finished difference Result 77393 states and 330941 transitions. [2022-02-10 22:42:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-10 22:42:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 39 states have internal predecessors, (263), 0 states have call successors, (0), 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-02-10 22:42:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:14,384 INFO L225 Difference]: With dead ends: 77393 [2022-02-10 22:42:14,385 INFO L226 Difference]: Without dead ends: 74072 [2022-02-10 22:42:14,385 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 315 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=2582, Unknown=2, NotChecked=218, Total=3306 [2022-02-10 22:42:14,394 INFO L934 BasicCegarLoop]: 262 mSDtfsCounter, 1032 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:14,394 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 3739 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1060 Invalid, 0 Unknown, 855 Unchecked, 0.4s Time] [2022-02-10 22:42:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74072 states. [2022-02-10 22:42:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74072 to 42526. [2022-02-10 22:42:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42526 states, 42525 states have (on average 4.203080540858319) internal successors, (178736), 42525 states have internal predecessors, (178736), 0 states have call successors, (0), 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-02-10 22:42:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42526 states to 42526 states and 178736 transitions. [2022-02-10 22:42:16,053 INFO L78 Accepts]: Start accepts. Automaton has 42526 states and 178736 transitions. Word has length 170 [2022-02-10 22:42:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:16,053 INFO L470 AbstractCegarLoop]: Abstraction has 42526 states and 178736 transitions. [2022-02-10 22:42:16,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 39 states have internal predecessors, (263), 0 states have call successors, (0), 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-02-10 22:42:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 42526 states and 178736 transitions. [2022-02-10 22:42:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:16,155 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:16,155 INFO L515 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-02-10 22:42:16,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:16,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:16,356 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash -624232837, now seen corresponding path program 28 times [2022-02-10 22:42:16,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:16,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433194467] [2022-02-10 22:42:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:16,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:16,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433194467] [2022-02-10 22:42:16,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433194467] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:16,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816068540] [2022-02-10 22:42:16,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:42:16,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:16,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:16,979 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:16,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-02-10 22:42:17,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:42:17,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:17,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-02-10 22:42:17,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:17,656 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 16 treesize of output 18 [2022-02-10 22:42:17,689 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 7 [2022-02-10 22:42:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:42:17,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:18,099 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2464 (Array Int Int))) (< (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2464) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 1 c_~s_2~0))) (forall ((v_ArrVal_2464 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2464) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0)))) is different from false [2022-02-10 22:42:18,107 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:18,107 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 58 treesize of output 49 [2022-02-10 22:42:18,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 18 treesize of output 11 [2022-02-10 22:42:18,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:18,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:18,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 5 [2022-02-10 22:42:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:18,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816068540] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:18,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:18,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 17] total 49 [2022-02-10 22:42:18,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135130682] [2022-02-10 22:42:18,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:18,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-10 22:42:18,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-10 22:42:18,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2080, Unknown=1, NotChecked=92, Total=2352 [2022-02-10 22:42:18,894 INFO L87 Difference]: Start difference. First operand 42526 states and 178736 transitions. Second operand has 49 states, 49 states have (on average 6.714285714285714) internal successors, (329), 49 states have internal predecessors, (329), 0 states have call successors, (0), 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-02-10 22:42:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:21,974 INFO L93 Difference]: Finished difference Result 65450 states and 276248 transitions. [2022-02-10 22:42:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-10 22:42:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.714285714285714) internal successors, (329), 49 states have internal predecessors, (329), 0 states have call successors, (0), 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-02-10 22:42:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:22,236 INFO L225 Difference]: With dead ends: 65450 [2022-02-10 22:42:22,236 INFO L226 Difference]: Without dead ends: 62069 [2022-02-10 22:42:22,237 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=748, Invalid=4955, Unknown=1, NotChecked=148, Total=5852 [2022-02-10 22:42:22,237 INFO L934 BasicCegarLoop]: 258 mSDtfsCounter, 1526 mSDsluCounter, 5469 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 3013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:22,237 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 4965 Invalid, 3013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2524 Invalid, 0 Unknown, 441 Unchecked, 1.0s Time] [2022-02-10 22:42:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62069 states. [2022-02-10 22:42:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62069 to 42162. [2022-02-10 22:42:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42162 states, 42161 states have (on average 4.1999003818695) internal successors, (177072), 42161 states have internal predecessors, (177072), 0 states have call successors, (0), 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-02-10 22:42:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42162 states to 42162 states and 177072 transitions. [2022-02-10 22:42:23,679 INFO L78 Accepts]: Start accepts. Automaton has 42162 states and 177072 transitions. Word has length 170 [2022-02-10 22:42:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:23,679 INFO L470 AbstractCegarLoop]: Abstraction has 42162 states and 177072 transitions. [2022-02-10 22:42:23,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.714285714285714) internal successors, (329), 49 states have internal predecessors, (329), 0 states have call successors, (0), 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-02-10 22:42:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42162 states and 177072 transitions. [2022-02-10 22:42:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:24,129 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:24,129 INFO L515 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-02-10 22:42:24,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:24,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:24,343 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1880086841, now seen corresponding path program 29 times [2022-02-10 22:42:24,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:24,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702271716] [2022-02-10 22:42:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:24,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:24,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702271716] [2022-02-10 22:42:24,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702271716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:24,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073208119] [2022-02-10 22:42:24,680 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:42:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:24,682 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:24,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-02-10 22:42:24,892 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:42:24,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:24,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-10 22:42:24,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:25,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:25,343 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 16 treesize of output 18 [2022-02-10 22:42:25,417 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-02-10 22:42:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:25,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:25,778 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2513 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2513) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2513 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2513) 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-02-10 22:42:25,786 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:25,786 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 60 treesize of output 51 [2022-02-10 22:42:25,789 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 19 treesize of output 12 [2022-02-10 22:42:25,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:25,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:25,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-02-10 22:42:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:26,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073208119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:26,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:26,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 39 [2022-02-10 22:42:26,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698997862] [2022-02-10 22:42:26,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:26,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-10 22:42:26,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-10 22:42:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1272, Unknown=1, NotChecked=72, Total=1482 [2022-02-10 22:42:26,221 INFO L87 Difference]: Start difference. First operand 42162 states and 177072 transitions. Second operand has 39 states, 39 states have (on average 6.923076923076923) internal successors, (270), 39 states have internal predecessors, (270), 0 states have call successors, (0), 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-02-10 22:42:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:27,893 INFO L93 Difference]: Finished difference Result 68636 states and 291087 transitions. [2022-02-10 22:42:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 22:42:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.923076923076923) internal successors, (270), 39 states have internal predecessors, (270), 0 states have call successors, (0), 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-02-10 22:42:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:28,429 INFO L225 Difference]: With dead ends: 68636 [2022-02-10 22:42:28,429 INFO L226 Difference]: Without dead ends: 65315 [2022-02-10 22:42:28,430 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 315 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=445, Invalid=2528, Unknown=1, NotChecked=106, Total=3080 [2022-02-10 22:42:28,430 INFO L934 BasicCegarLoop]: 262 mSDtfsCounter, 1209 mSDsluCounter, 3994 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 3809 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:28,430 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 3809 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1236 Invalid, 0 Unknown, 370 Unchecked, 0.5s Time] [2022-02-10 22:42:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65315 states. [2022-02-10 22:42:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65315 to 41013. [2022-02-10 22:42:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41013 states, 41012 states have (on average 4.189310445723203) internal successors, (171812), 41012 states have internal predecessors, (171812), 0 states have call successors, (0), 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-02-10 22:42:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41013 states to 41013 states and 171812 transitions. [2022-02-10 22:42:30,170 INFO L78 Accepts]: Start accepts. Automaton has 41013 states and 171812 transitions. Word has length 170 [2022-02-10 22:42:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:30,170 INFO L470 AbstractCegarLoop]: Abstraction has 41013 states and 171812 transitions. [2022-02-10 22:42:30,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.923076923076923) internal successors, (270), 39 states have internal predecessors, (270), 0 states have call successors, (0), 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-02-10 22:42:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 41013 states and 171812 transitions. [2022-02-10 22:42:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:30,283 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:30,283 INFO L515 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-02-10 22:42:30,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:30,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-02-10 22:42:30,484 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -13807195, now seen corresponding path program 30 times [2022-02-10 22:42:30,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:30,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435360165] [2022-02-10 22:42:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:30,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:30,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435360165] [2022-02-10 22:42:30,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435360165] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:30,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42625276] [2022-02-10 22:42:30,878 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:42:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:30,879 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:30,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-02-10 22:42:31,291 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:42:31,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:31,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 85 conjunts are in the unsatisfiable core [2022-02-10 22:42:31,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:31,482 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-02-10 22:42:31,750 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 22:42:31,750 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-02-10 22:42:31,779 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-10 22:42:31,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-10 22:42:31,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-10 22:42:32,115 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-02-10 22:42:32,195 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-02-10 22:42:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:32,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:32,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2565 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) 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_2565 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) 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-02-10 22:42:32,565 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2565 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2565 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:42:32,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2565 (Array Int Int)) (v_ArrVal_2564 (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_2564) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2565 (Array Int Int)) (v_ArrVal_2564 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2564) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2565) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:42:32,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:32,604 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 266 treesize of output 194 [2022-02-10 22:42:32,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 148 [2022-02-10 22:42:32,877 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 81 treesize of output 67 [2022-02-10 22:42:32,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:32,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:32,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:32,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2022-02-10 22:42:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:34,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42625276] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:34,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:34,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26, 23] total 54 [2022-02-10 22:42:34,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909976967] [2022-02-10 22:42:34,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:34,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-10 22:42:34,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:34,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-10 22:42:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2347, Unknown=3, NotChecked=300, Total=2862 [2022-02-10 22:42:34,477 INFO L87 Difference]: Start difference. First operand 41013 states and 171812 transitions. Second operand has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 0 states have call successors, (0), 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-02-10 22:42:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:38,017 INFO L93 Difference]: Finished difference Result 94717 states and 411776 transitions. [2022-02-10 22:42:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-10 22:42:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 0 states have call successors, (0), 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-02-10 22:42:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:38,476 INFO L225 Difference]: With dead ends: 94717 [2022-02-10 22:42:38,476 INFO L226 Difference]: Without dead ends: 91000 [2022-02-10 22:42:38,477 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1056, Invalid=7882, Unknown=4, NotChecked=564, Total=9506 [2022-02-10 22:42:38,477 INFO L934 BasicCegarLoop]: 275 mSDtfsCounter, 2197 mSDsluCounter, 7268 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 6509 SdHoareTripleChecker+Invalid, 4582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2373 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:38,477 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2197 Valid, 6509 Invalid, 4582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2109 Invalid, 0 Unknown, 2373 Unchecked, 1.0s Time] [2022-02-10 22:42:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91000 states. [2022-02-10 22:42:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91000 to 41429. [2022-02-10 22:42:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41429 states, 41428 states have (on average 4.196678574876895) internal successors, (173860), 41428 states have internal predecessors, (173860), 0 states have call successors, (0), 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-02-10 22:42:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41429 states to 41429 states and 173860 transitions. [2022-02-10 22:42:40,759 INFO L78 Accepts]: Start accepts. Automaton has 41429 states and 173860 transitions. Word has length 170 [2022-02-10 22:42:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:40,759 INFO L470 AbstractCegarLoop]: Abstraction has 41429 states and 173860 transitions. [2022-02-10 22:42:40,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.407407407407407) internal successors, (292), 54 states have internal predecessors, (292), 0 states have call successors, (0), 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-02-10 22:42:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 41429 states and 173860 transitions. [2022-02-10 22:42:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:40,892 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:40,892 INFO L515 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-02-10 22:42:40,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:41,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-02-10 22:42:41,119 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash -904446585, now seen corresponding path program 16 times [2022-02-10 22:42:41,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:41,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289265073] [2022-02-10 22:42:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:42:42,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:42,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289265073] [2022-02-10 22:42:42,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289265073] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:42,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840927204] [2022-02-10 22:42:42,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 22:42:42,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:42,084 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:42,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-02-10 22:42:42,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 22:42:42,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-10 22:42:42,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:42,524 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-02-10 22:42:42,764 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 22:42:42,764 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-02-10 22:42:42,802 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-10 22:42:42,803 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-02-10 22:42:43,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-10 22:42:43,193 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-02-10 22:42:43,527 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-02-10 22:42:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-10 22:42:43,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:43,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2617 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) 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_2617 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) 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-02-10 22:42:43,943 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2617 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2617 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:42:43,977 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2617 (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_2616) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2617 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2616) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2617) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1)))) is different from false [2022-02-10 22:42:43,985 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:43,985 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 124 treesize of output 97 [2022-02-10 22:42:43,988 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 79 treesize of output 65 [2022-02-10 22:42:43,991 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 35 treesize of output 28 [2022-02-10 22:42:44,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:44,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:44,056 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:42:44,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-02-10 22:42:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:45,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840927204] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:45,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:45,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 19] total 54 [2022-02-10 22:42:45,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961167168] [2022-02-10 22:42:45,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:45,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-02-10 22:42:45,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-02-10 22:42:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2384, Unknown=3, NotChecked=300, Total=2862 [2022-02-10 22:42:45,212 INFO L87 Difference]: Start difference. First operand 41429 states and 173860 transitions. Second operand has 54 states, 54 states have (on average 6.148148148148148) internal successors, (332), 54 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:42:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:48,800 INFO L93 Difference]: Finished difference Result 72143 states and 308225 transitions. [2022-02-10 22:42:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-10 22:42:48,800 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.148148148148148) internal successors, (332), 54 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2022-02-10 22:42:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:49,118 INFO L225 Difference]: With dead ends: 72143 [2022-02-10 22:42:49,118 INFO L226 Difference]: Without dead ends: 68822 [2022-02-10 22:42:49,119 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 313 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=624, Invalid=5391, Unknown=3, NotChecked=462, Total=6480 [2022-02-10 22:42:49,119 INFO L934 BasicCegarLoop]: 253 mSDtfsCounter, 1756 mSDsluCounter, 7278 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 6516 SdHoareTripleChecker+Invalid, 4451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1954 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:49,119 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 6516 Invalid, 4451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2444 Invalid, 0 Unknown, 1954 Unchecked, 1.1s Time] [2022-02-10 22:42:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68822 states. [2022-02-10 22:42:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68822 to 41305. [2022-02-10 22:42:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41305 states, 41304 states have (on average 4.182984698818516) internal successors, (172774), 41304 states have internal predecessors, (172774), 0 states have call successors, (0), 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-02-10 22:42:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41305 states to 41305 states and 172774 transitions. [2022-02-10 22:42:50,721 INFO L78 Accepts]: Start accepts. Automaton has 41305 states and 172774 transitions. Word has length 170 [2022-02-10 22:42:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:50,721 INFO L470 AbstractCegarLoop]: Abstraction has 41305 states and 172774 transitions. [2022-02-10 22:42:50,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.148148148148148) internal successors, (332), 54 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 22:42:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41305 states and 172774 transitions. [2022-02-10 22:42:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:50,819 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:50,819 INFO L515 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-02-10 22:42:50,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-02-10 22:42:51,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-02-10 22:42:51,020 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash -696791485, now seen corresponding path program 17 times [2022-02-10 22:42:51,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:51,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679716232] [2022-02-10 22:42:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:51,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:51,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:51,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679716232] [2022-02-10 22:42:51,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679716232] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:51,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813403474] [2022-02-10 22:42:51,701 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-10 22:42:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:51,703 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-02-10 22:42:51,893 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-10 22:42:51,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:51,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-10 22:42:51,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:52,321 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 16 treesize of output 18 [2022-02-10 22:42:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-10 22:42:52,407 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 16 treesize of output 18 [2022-02-10 22:42:52,465 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 7 [2022-02-10 22:42:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:52,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:42:52,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2667 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2667) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2667 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2667) 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-02-10 22:42:52,894 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2666) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2667) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (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_2666) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2667) 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-02-10 22:42:52,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:42:52,903 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 258 treesize of output 186 [2022-02-10 22:42:52,905 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 168 treesize of output 140 [2022-02-10 22:42:52,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 126 [2022-02-10 22:42:52,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:52,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-10 22:42:52,985 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-02-10 22:42:52,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-02-10 22:42:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:53,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813403474] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 22:42:53,387 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 22:42:53,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 42 [2022-02-10 22:42:53,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241631168] [2022-02-10 22:42:53,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 22:42:53,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-10 22:42:53,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 22:42:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-10 22:42:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1416, Unknown=2, NotChecked=154, Total=1722 [2022-02-10 22:42:53,388 INFO L87 Difference]: Start difference. First operand 41305 states and 172774 transitions. Second operand has 42 states, 42 states have (on average 6.119047619047619) internal successors, (257), 42 states have internal predecessors, (257), 0 states have call successors, (0), 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-02-10 22:42:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 22:42:55,356 INFO L93 Difference]: Finished difference Result 61111 states and 258705 transitions. [2022-02-10 22:42:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-10 22:42:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.119047619047619) internal successors, (257), 42 states have internal predecessors, (257), 0 states have call successors, (0), 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-02-10 22:42:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 22:42:55,746 INFO L225 Difference]: With dead ends: 61111 [2022-02-10 22:42:55,746 INFO L226 Difference]: Without dead ends: 57790 [2022-02-10 22:42:55,746 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 314 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=488, Invalid=2824, Unknown=2, NotChecked=226, Total=3540 [2022-02-10 22:42:55,747 INFO L934 BasicCegarLoop]: 262 mSDtfsCounter, 1070 mSDsluCounter, 5322 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 661 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-10 22:42:55,747 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 5011 Invalid, 2528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1834 Invalid, 0 Unknown, 661 Unchecked, 0.7s Time] [2022-02-10 22:42:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57790 states. [2022-02-10 22:42:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57790 to 41356. [2022-02-10 22:42:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41356 states, 41355 states have (on average 4.18408898561238) internal successors, (173033), 41355 states have internal predecessors, (173033), 0 states have call successors, (0), 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-02-10 22:42:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41356 states to 41356 states and 173033 transitions. [2022-02-10 22:42:57,035 INFO L78 Accepts]: Start accepts. Automaton has 41356 states and 173033 transitions. Word has length 170 [2022-02-10 22:42:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 22:42:57,035 INFO L470 AbstractCegarLoop]: Abstraction has 41356 states and 173033 transitions. [2022-02-10 22:42:57,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.119047619047619) internal successors, (257), 42 states have internal predecessors, (257), 0 states have call successors, (0), 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-02-10 22:42:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 41356 states and 173033 transitions. [2022-02-10 22:42:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-10 22:42:57,458 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 22:42:57,458 INFO L515 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-02-10 22:42:57,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-02-10 22:42:57,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-02-10 22:42:57,674 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 22:42:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 22:42:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2115241357, now seen corresponding path program 18 times [2022-02-10 22:42:57,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 22:42:57,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767199713] [2022-02-10 22:42:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 22:42:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 22:42:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 22:42:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-10 22:42:58,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 22:42:58,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767199713] [2022-02-10 22:42:58,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767199713] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 22:42:58,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910003009] [2022-02-10 22:42:58,020 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-10 22:42:58,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 22:42:58,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 22:42:58,021 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-10 22:42:58,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-02-10 22:42:58,328 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-10 22:42:58,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 22:42:58,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 100 conjunts are in the unsatisfiable core [2022-02-10 22:42:58,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 22:42:58,372 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-02-10 22:42:58,679 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-10 22:42:58,679 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-02-10 22:42:58,984 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-02-10 22:42:59,261 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-02-10 22:42:59,332 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-02-10 22:42:59,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-02-10 22:42:59,386 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-10 22:42:59,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-02-10 22:42:59,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-10 22:42:59,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-10 22:42:59,817 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 16 treesize of output 18 [2022-02-10 22:42:59,885 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 7 [2022-02-10 22:43:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 22:43:00,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 22:43:00,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))))) (let ((.cse0 (+ .cse2 c_~s_2~0))) (or (not (<= .cse0 2147483647)) (let ((.cse1 (+ c_~s_6~0 c_~t_8~0))) (and (<= .cse0 .cse1) (< .cse1 (+ .cse2 1 c_~s_2~0)))))))) is different from false [2022-02-10 22:43:00,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2723) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))))) (let ((.cse0 (+ .cse2 c_~s_2~0))) (or (let ((.cse1 (+ c_~s_6~0 c_~t_8~0))) (and (<= .cse0 .cse1) (< .cse1 (+ .cse2 1 c_~s_2~0)))) (not (<= .cse0 2147483647)))))) is different from false [2022-02-10 22:43:00,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2723) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))))) (let ((.cse0 (+ .cse2 c_~s_2~0))) (or (not (<= .cse0 2147483647)) (let ((.cse1 (+ 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)))))) (and (< .cse1 (+ .cse2 1 c_~s_2~0)) (<= .cse0 .cse1))))))) is different from false [2022-02-10 22:43:00,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2723) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))))) (let ((.cse0 (+ .cse2 c_~s_2~0))) (or (not (<= .cse0 2147483647)) (let ((.cse1 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (and (<= .cse0 .cse1) (< .cse1 (+ .cse2 1 c_~s_2~0)))))))) is different from false [2022-02-10 22:43:00,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int)) (v_ArrVal_2722 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2722))) (let ((.cse1 (select (select (store (store .cse3 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2723) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))))) (let ((.cse2 (+ .cse1 c_~s_2~0))) (or (let ((.cse0 (select (select .cse3 c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (and (< .cse0 (+ .cse1 1 c_~s_2~0)) (<= .cse2 .cse0))) (not (<= .cse2 2147483647))))))) is different from false [2022-02-10 22:43:00,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2723 (Array Int Int)) (v_ArrVal_2722 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2722)) (.cse3 (+ c_~X_0~0.offset 4))) (let ((.cse1 (select (select (store (store .cse2 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_2723) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2724) c_~X_0~0.base) .cse3))) (or (let ((.cse0 (select (select .cse2 c_~X_0~0.base) .cse3))) (and (< .cse0 (+ .cse1 1)) (<= .cse1 .cse0))) (not (<= .cse1 2147483647)))))) is different from false [2022-02-10 22:43:04,549 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-10 22:43:04,549 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 152 treesize of output 104 [2022-02-10 22:43:04,562 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 45716 treesize of output 42212 [2022-02-10 22:43:06,166 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 39876 treesize of output 37700 [2022-02-10 22:43:06,277 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 37700 treesize of output 33796 [2022-02-10 22:43:06,406 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 33796 treesize of output 31588 [2022-02-10 22:43:06,560 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 31588 treesize of output 27236 [2022-02-10 22:43:06,659 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-10 22:43:06,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-02-10 22:43:06,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-02-10 22:43:06,861 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:611) 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:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:308) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-02-10 22:43:06,864 INFO L158 Benchmark]: Toolchain (without parser) took 418809.60ms. Allocated memory was 186.6MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.1MB in the beginning and 5.9GB in the end (delta: -5.8GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.52ms. Allocated memory was 186.6MB in the beginning and 277.9MB in the end (delta: 91.2MB). Free memory was 129.9MB in the beginning and 246.9MB in the end (delta: -117.0MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 277.9MB. Free memory was 246.9MB in the beginning and 244.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: Boogie Preprocessor took 25.54ms. Allocated memory is still 277.9MB. Free memory was 244.2MB in the beginning and 242.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: RCFGBuilder took 629.51ms. Allocated memory is still 277.9MB. Free memory was 242.7MB in the beginning and 206.5MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 INFO L158 Benchmark]: TraceAbstraction took 417848.87ms. Allocated memory was 277.9MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 206.0MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-02-10 22:43:06,864 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 186.6MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.52ms. Allocated memory was 186.6MB in the beginning and 277.9MB in the end (delta: 91.2MB). Free memory was 129.9MB in the beginning and 246.9MB in the end (delta: -117.0MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 277.9MB. Free memory was 246.9MB in the beginning and 244.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.54ms. Allocated memory is still 277.9MB. Free memory was 244.2MB in the beginning and 242.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 629.51ms. Allocated memory is still 277.9MB. Free memory was 242.7MB in the beginning and 206.5MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 417848.87ms. Allocated memory was 277.9MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 206.0MB in the beginning and 5.9GB in the end (delta: -5.7GB). Peak memory consumption was 2.8GB. 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-02-10 22:43:06,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...