/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/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 13:36:27,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 13:36:27,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 13:36:28,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 13:36:28,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 13:36:28,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 13:36:28,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 13:36:28,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 13:36:28,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 13:36:28,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 13:36:28,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 13:36:28,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 13:36:28,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 13:36:28,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 13:36:28,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 13:36:28,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 13:36:28,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 13:36:28,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 13:36:28,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 13:36:28,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 13:36:28,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 13:36:28,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 13:36:28,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 13:36:28,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 13:36:28,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 13:36:28,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 13:36:28,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 13:36:28,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 13:36:28,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 13:36:28,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 13:36:28,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 13:36:28,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 13:36:28,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 13:36:28,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 13:36:28,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 13:36:28,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 13:36:28,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 13:36:28,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 13:36:28,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 13:36:28,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 13:36:28,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 13:36:28,064 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-01-28 13:36:28,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 13:36:28,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 13:36:28,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 13:36:28,084 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 13:36:28,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 13:36:28,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 13:36:28,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 13:36:28,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 13:36:28,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 13:36:28,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 13:36:28,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 13:36:28,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:36:28,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 13:36:28,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 13:36:28,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 13:36:28,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 13:36:28,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 13:36:28,090 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 13:36:28,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 13:36:28,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-28 13:36:28,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 13:36:28,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 13:36:28,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 13:36:28,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 13:36:28,310 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 13:36:28,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-01-28 13:36:28,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2bb95cb/5ded05d47de64aa3a65f84e96fa8994b/FLAG358133278 [2022-01-28 13:36:28,724 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 13:36:28,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-01-28 13:36:28,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2bb95cb/5ded05d47de64aa3a65f84e96fa8994b/FLAG358133278 [2022-01-28 13:36:29,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2bb95cb/5ded05d47de64aa3a65f84e96fa8994b [2022-01-28 13:36:29,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 13:36:29,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 13:36:29,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 13:36:29,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 13:36:29,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 13:36:29,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4067c8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29, skipping insertion in model container [2022-01-28 13:36:29,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 13:36:29,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 13:36:29,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-01-28 13:36:29,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:36:29,349 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 13:36:29,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-01-28 13:36:29,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:36:29,381 INFO L208 MainTranslator]: Completed translation [2022-01-28 13:36:29,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29 WrapperNode [2022-01-28 13:36:29,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 13:36:29,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 13:36:29,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 13:36:29,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 13:36:29,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,425 INFO L137 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-01-28 13:36:29,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 13:36:29,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 13:36:29,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 13:36:29,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 13:36:29,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 13:36:29,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 13:36:29,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 13:36:29,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 13:36:29,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (1/1) ... [2022-01-28 13:36:29,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:36:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:29,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-28 13:36:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-28 13:36:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-28 13:36:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 13:36:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 13:36:29,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 13:36:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 13:36:29,568 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 13:36:29,649 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 13:36:29,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 13:36:29,873 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 13:36:29,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 13:36:29,957 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-28 13:36:29,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:36:29 BoogieIcfgContainer [2022-01-28 13:36:29,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 13:36:29,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 13:36:29,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 13:36:29,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 13:36:29,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:36:29" (1/3) ... [2022-01-28 13:36:29,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e4d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:36:29, skipping insertion in model container [2022-01-28 13:36:29,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:36:29" (2/3) ... [2022-01-28 13:36:29,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e4d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:36:29, skipping insertion in model container [2022-01-28 13:36:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:36:29" (3/3) ... [2022-01-28 13:36:29,966 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-01-28 13:36:29,969 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 13:36:29,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 13:36:29,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-28 13:36:29,969 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 13:36:30,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:36:30,015 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-28 13:36:30,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 13:36:30,048 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-01-28 13:36:30,049 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-28 13:36:30,057 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 136 transitions, 288 flow [2022-01-28 13:36:30,118 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 490 states, 489 states have (on average 2.5848670756646217) internal successors, (1264), 489 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 490 states, 489 states have (on average 2.5848670756646217) internal successors, (1264), 489 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-28 13:36:30,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:30,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:30,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:30,144 INFO L85 PathProgramCache]: Analyzing trace with hash -90218077, now seen corresponding path program 1 times [2022-01-28 13:36:30,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:30,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187522056] [2022-01-28 13:36:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:30,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:30,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187522056] [2022-01-28 13:36:30,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187522056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:36:30,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:36:30,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 13:36:30,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845814483] [2022-01-28 13:36:30,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:36:30,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-28 13:36:30,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-28 13:36:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:36:30,365 INFO L87 Difference]: Start difference. First operand has 490 states, 489 states have (on average 2.5848670756646217) internal successors, (1264), 489 states have internal predecessors, (1264), 0 states have call successors, (0), 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 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:30,420 INFO L93 Difference]: Finished difference Result 490 states and 1135 transitions. [2022-01-28 13:36:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-28 13:36:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-01-28 13:36:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:30,440 INFO L225 Difference]: With dead ends: 490 [2022-01-28 13:36:30,440 INFO L226 Difference]: Without dead ends: 486 [2022-01-28 13:36:30,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:36:30,445 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:30,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:36:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-01-28 13:36:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-01-28 13:36:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.331958762886598) internal successors, (1131), 485 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1131 transitions. [2022-01-28 13:36:30,497 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1131 transitions. Word has length 97 [2022-01-28 13:36:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:30,498 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 1131 transitions. [2022-01-28 13:36:30,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1131 transitions. [2022-01-28 13:36:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-28 13:36:30,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:30,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:30,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 13:36:30,502 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 751312825, now seen corresponding path program 1 times [2022-01-28 13:36:30,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:30,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148633384] [2022-01-28 13:36:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:30,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:30,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148633384] [2022-01-28 13:36:30,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148633384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:36:30,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:36:30,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:36:30,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562734697] [2022-01-28 13:36:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:36:30,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:36:30,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:30,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:36:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:36:30,650 INFO L87 Difference]: Start difference. First operand 486 states and 1131 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:30,747 INFO L93 Difference]: Finished difference Result 579 states and 1299 transitions. [2022-01-28 13:36:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-28 13:36:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2022-01-28 13:36:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:30,752 INFO L225 Difference]: With dead ends: 579 [2022-01-28 13:36:30,752 INFO L226 Difference]: Without dead ends: 492 [2022-01-28 13:36:30,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:36:30,753 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 226 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:30,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 333 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:36:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-28 13:36:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 487. [2022-01-28 13:36:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 2.3292181069958846) internal successors, (1132), 486 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1132 transitions. [2022-01-28 13:36:30,775 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1132 transitions. Word has length 100 [2022-01-28 13:36:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:30,775 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 1132 transitions. [2022-01-28 13:36:30,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1132 transitions. [2022-01-28 13:36:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 13:36:30,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:30,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:30,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 13:36:30,779 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:30,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2074297026, now seen corresponding path program 1 times [2022-01-28 13:36:30,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:30,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919230418] [2022-01-28 13:36:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:30,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:36:30,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919230418] [2022-01-28 13:36:30,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919230418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:36:30,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:36:30,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-28 13:36:30,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790767955] [2022-01-28 13:36:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:36:30,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 13:36:30,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 13:36:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 13:36:30,873 INFO L87 Difference]: Start difference. First operand 487 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:30,887 INFO L93 Difference]: Finished difference Result 521 states and 1214 transitions. [2022-01-28 13:36:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 13:36:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-01-28 13:36:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:30,890 INFO L225 Difference]: With dead ends: 521 [2022-01-28 13:36:30,890 INFO L226 Difference]: Without dead ends: 521 [2022-01-28 13:36:30,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 13:36:30,891 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:30,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 164 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:36:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-28 13:36:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2022-01-28 13:36:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.3346153846153848) internal successors, (1214), 520 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1214 transitions. [2022-01-28 13:36:30,901 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1214 transitions. Word has length 107 [2022-01-28 13:36:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:30,902 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1214 transitions. [2022-01-28 13:36:30,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1214 transitions. [2022-01-28 13:36:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-28 13:36:30,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:30,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:30,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 13:36:30,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -940192228, now seen corresponding path program 2 times [2022-01-28 13:36:30,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:30,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81172154] [2022-01-28 13:36:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:30,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:36:31,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:31,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81172154] [2022-01-28 13:36:31,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81172154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:36:31,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:36:31,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-28 13:36:31,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18954790] [2022-01-28 13:36:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:36:31,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-28 13:36:31,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-28 13:36:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:36:31,129 INFO L87 Difference]: Start difference. First operand 521 states and 1214 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:31,255 INFO L93 Difference]: Finished difference Result 856 states and 2027 transitions. [2022-01-28 13:36:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-28 13:36:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-01-28 13:36:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:31,259 INFO L225 Difference]: With dead ends: 856 [2022-01-28 13:36:31,260 INFO L226 Difference]: Without dead ends: 805 [2022-01-28 13:36:31,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-01-28 13:36:31,268 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:31,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 661 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:36:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-01-28 13:36:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 614. [2022-01-28 13:36:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.3148450244698204) internal successors, (1419), 613 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1419 transitions. [2022-01-28 13:36:31,288 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1419 transitions. Word has length 107 [2022-01-28 13:36:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:31,289 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 1419 transitions. [2022-01-28 13:36:31,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1419 transitions. [2022-01-28 13:36:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-28 13:36:31,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:31,291 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-28 13:36:31,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 13:36:31,291 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1596238760, now seen corresponding path program 1 times [2022-01-28 13:36:31,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492510938] [2022-01-28 13:36:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:31,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:31,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:31,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492510938] [2022-01-28 13:36:31,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492510938] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:31,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700162187] [2022-01-28 13:36:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:31,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:31,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:31,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:31,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-28 13:36:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:31,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-28 13:36:31,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:36:31,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-28 13:36:31,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700162187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:36:31,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-28 13:36:31,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2022-01-28 13:36:31,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263717287] [2022-01-28 13:36:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:36:31,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-28 13:36:31,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-28 13:36:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:36:31,779 INFO L87 Difference]: Start difference. First operand 614 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:31,807 INFO L93 Difference]: Finished difference Result 1238 states and 3016 transitions. [2022-01-28 13:36:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-28 13:36:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 111 [2022-01-28 13:36:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:31,812 INFO L225 Difference]: With dead ends: 1238 [2022-01-28 13:36:31,812 INFO L226 Difference]: Without dead ends: 1097 [2022-01-28 13:36:31,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:36:31,813 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:31,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 211 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:36:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-01-28 13:36:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 837. [2022-01-28 13:36:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 2.5047846889952154) internal successors, (2094), 836 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2094 transitions. [2022-01-28 13:36:31,832 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 2094 transitions. Word has length 111 [2022-01-28 13:36:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:31,832 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 2094 transitions. [2022-01-28 13:36:31,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 2094 transitions. [2022-01-28 13:36:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-28 13:36:31,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:31,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:31,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:32,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:32,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:32,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash 891713281, now seen corresponding path program 1 times [2022-01-28 13:36:32,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:32,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145278369] [2022-01-28 13:36:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:32,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:32,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145278369] [2022-01-28 13:36:32,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145278369] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982523845] [2022-01-28 13:36:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:32,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:32,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:32,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-28 13:36:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:32,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-28 13:36:32,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:32,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:32,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982523845] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:32,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:32,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-28 13:36:32,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401199319] [2022-01-28 13:36:32,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:32,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-28 13:36:32,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-28 13:36:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-28 13:36:32,821 INFO L87 Difference]: Start difference. First operand 837 states and 2094 transitions. Second operand has 19 states, 19 states have (on average 10.157894736842104) internal successors, (193), 19 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:33,019 INFO L93 Difference]: Finished difference Result 1194 states and 2907 transitions. [2022-01-28 13:36:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-28 13:36:33,019 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.157894736842104) internal successors, (193), 19 states have internal predecessors, (193), 0 states have call successors, (0), 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 112 [2022-01-28 13:36:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:33,022 INFO L225 Difference]: With dead ends: 1194 [2022-01-28 13:36:33,023 INFO L226 Difference]: Without dead ends: 849 [2022-01-28 13:36:33,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-01-28 13:36:33,023 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 583 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:33,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 908 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:36:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-01-28 13:36:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 844. [2022-01-28 13:36:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 2.4922894424673783) internal successors, (2101), 843 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2101 transitions. [2022-01-28 13:36:33,039 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2101 transitions. Word has length 112 [2022-01-28 13:36:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:33,040 INFO L470 AbstractCegarLoop]: Abstraction has 844 states and 2101 transitions. [2022-01-28 13:36:33,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.157894736842104) internal successors, (193), 19 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2101 transitions. [2022-01-28 13:36:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-28 13:36:33,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:33,042 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:33,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:33,259 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,SelfDestructingSolverStorable5 [2022-01-28 13:36:33,259 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1610634378, now seen corresponding path program 2 times [2022-01-28 13:36:33,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:33,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053410075] [2022-01-28 13:36:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:33,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:33,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053410075] [2022-01-28 13:36:33,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053410075] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284099692] [2022-01-28 13:36:33,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:36:33,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:33,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:34,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-28 13:36:34,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:36:34,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:34,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-28 13:36:34,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:34,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:36:34,888 INFO L388 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-01-28 13:36:34,974 INFO L388 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 7 [2022-01-28 13:36:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:35,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:35,350 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:35,350 INFO L388 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 45 treesize of output 45 [2022-01-28 13:36:35,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-01-28 13:36:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:36,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284099692] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:36,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:36,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 59 [2022-01-28 13:36:36,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508003323] [2022-01-28 13:36:36,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:36,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-28 13:36:36,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-28 13:36:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3032, Unknown=0, NotChecked=0, Total=3422 [2022-01-28 13:36:36,808 INFO L87 Difference]: Start difference. First operand 844 states and 2101 transitions. Second operand has 59 states, 59 states have (on average 4.932203389830509) internal successors, (291), 59 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:39,093 INFO L93 Difference]: Finished difference Result 2577 states and 6519 transitions. [2022-01-28 13:36:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-28 13:36:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 4.932203389830509) internal successors, (291), 59 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-01-28 13:36:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:39,101 INFO L225 Difference]: With dead ends: 2577 [2022-01-28 13:36:39,101 INFO L226 Difference]: Without dead ends: 2051 [2022-01-28 13:36:39,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1481, Invalid=7075, Unknown=0, NotChecked=0, Total=8556 [2022-01-28 13:36:39,103 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 2899 mSDsluCounter, 3771 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2899 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:39,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2899 Valid, 3676 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1560 Invalid, 0 Unknown, 109 Unchecked, 0.7s Time] [2022-01-28 13:36:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2022-01-28 13:36:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1455. [2022-01-28 13:36:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1454 states have (on average 2.5536451169188448) internal successors, (3713), 1454 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3713 transitions. [2022-01-28 13:36:39,135 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3713 transitions. Word has length 119 [2022-01-28 13:36:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:39,135 INFO L470 AbstractCegarLoop]: Abstraction has 1455 states and 3713 transitions. [2022-01-28 13:36:39,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.932203389830509) internal successors, (291), 59 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3713 transitions. [2022-01-28 13:36:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-28 13:36:39,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:39,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:36:39,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:39,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:39,355 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1403854876, now seen corresponding path program 3 times [2022-01-28 13:36:39,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:39,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544809433] [2022-01-28 13:36:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:39,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:40,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:40,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544809433] [2022-01-28 13:36:40,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544809433] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:40,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897264635] [2022-01-28 13:36:40,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:36:40,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:40,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:40,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-28 13:36:40,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-28 13:36:40,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:40,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-28 13:36:40,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:40,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:36:40,604 INFO L388 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-01-28 13:36:40,652 INFO L388 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 7 [2022-01-28 13:36:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:36:40,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:40,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_150) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) 0))) is different from false [2022-01-28 13:36:40,781 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:40,782 INFO L388 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 45 treesize of output 45 [2022-01-28 13:36:40,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-01-28 13:36:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-01-28 13:36:41,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897264635] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:41,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:41,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12, 12] total 45 [2022-01-28 13:36:41,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624272917] [2022-01-28 13:36:41,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:41,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-28 13:36:41,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-28 13:36:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1779, Unknown=1, NotChecked=84, Total=1980 [2022-01-28 13:36:41,251 INFO L87 Difference]: Start difference. First operand 1455 states and 3713 transitions. Second operand has 45 states, 45 states have (on average 6.2444444444444445) internal successors, (281), 45 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:43,552 INFO L93 Difference]: Finished difference Result 2095 states and 5291 transitions. [2022-01-28 13:36:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-28 13:36:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 6.2444444444444445) internal successors, (281), 45 states have internal predecessors, (281), 0 states have call successors, (0), 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 119 [2022-01-28 13:36:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:43,559 INFO L225 Difference]: With dead ends: 2095 [2022-01-28 13:36:43,560 INFO L226 Difference]: Without dead ends: 2095 [2022-01-28 13:36:43,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=805, Invalid=5360, Unknown=1, NotChecked=154, Total=6320 [2022-01-28 13:36:43,561 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 1572 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:43,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 3409 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1512 Invalid, 0 Unknown, 174 Unchecked, 0.6s Time] [2022-01-28 13:36:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-01-28 13:36:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1394. [2022-01-28 13:36:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 2.5233309404163675) internal successors, (3515), 1393 states have internal predecessors, (3515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3515 transitions. [2022-01-28 13:36:43,592 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3515 transitions. Word has length 119 [2022-01-28 13:36:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:43,592 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 3515 transitions. [2022-01-28 13:36:43,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 6.2444444444444445) internal successors, (281), 45 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3515 transitions. [2022-01-28 13:36:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:36:43,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:43,595 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:36:43,613 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-01-28 13:36:43,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:43,812 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -871935768, now seen corresponding path program 1 times [2022-01-28 13:36:43,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:43,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843601310] [2022-01-28 13:36:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:43,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:44,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843601310] [2022-01-28 13:36:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843601310] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:44,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133220713] [2022-01-28 13:36:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:44,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:44,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:36:44,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-28 13:36:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:44,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-28 13:36:44,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:44,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:36:45,225 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:36:45,225 INFO L388 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-01-28 13:36:46,473 INFO L388 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 19 treesize of output 21 [2022-01-28 13:36:46,630 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-28 13:36:46,631 INFO L388 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 24 treesize of output 10 [2022-01-28 13:36:46,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:46,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:47,187 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_180 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_180 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:47,241 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_180 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_180 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:47,268 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_180 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_180 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:47,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:47,353 INFO L388 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 82 treesize of output 74 [2022-01-28 13:36:47,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:36:47,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:36:49,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:36:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-28 13:36:49,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133220713] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:36:49,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:36:49,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 82 [2022-01-28 13:36:49,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858783478] [2022-01-28 13:36:49,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:36:49,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-28 13:36:49,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:36:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-28 13:36:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=5671, Unknown=6, NotChecked=468, Total=6642 [2022-01-28 13:36:49,364 INFO L87 Difference]: Start difference. First operand 1394 states and 3515 transitions. Second operand has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:36:55,839 INFO L93 Difference]: Finished difference Result 2720 states and 6682 transitions. [2022-01-28 13:36:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-28 13:36:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 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 123 [2022-01-28 13:36:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:36:55,847 INFO L225 Difference]: With dead ends: 2720 [2022-01-28 13:36:55,847 INFO L226 Difference]: Without dead ends: 2425 [2022-01-28 13:36:55,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 200 SyntacticMatches, 23 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8150 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2037, Invalid=19345, Unknown=92, NotChecked=876, Total=22350 [2022-01-28 13:36:55,853 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 3389 mSDsluCounter, 7841 mSDsCounter, 0 mSdLazyCounter, 3482 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3389 SdHoareTripleChecker+Valid, 7298 SdHoareTripleChecker+Invalid, 5823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2014 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:36:55,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3389 Valid, 7298 Invalid, 5823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3482 Invalid, 0 Unknown, 2014 Unchecked, 1.5s Time] [2022-01-28 13:36:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-01-28 13:36:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1445. [2022-01-28 13:36:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 2.5166204986149583) internal successors, (3634), 1444 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 3634 transitions. [2022-01-28 13:36:55,882 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 3634 transitions. Word has length 123 [2022-01-28 13:36:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:36:55,882 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 3634 transitions. [2022-01-28 13:36:55,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:36:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 3634 transitions. [2022-01-28 13:36:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:36:55,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:36:55,885 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:36:55,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-28 13:36:56,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:56,100 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:36:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:36:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 155861536, now seen corresponding path program 2 times [2022-01-28 13:36:56,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:36:56,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665790789] [2022-01-28 13:36:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:36:56,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:36:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:36:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:57,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:36:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665790789] [2022-01-28 13:36:57,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665790789] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:36:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262126647] [2022-01-28 13:36:57,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:36:57,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:36:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:36:57,486 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-01-28 13:36:57,486 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-01-28 13:36:57,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:36:57,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:36:57,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-28 13:36:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:36:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:36:58,859 INFO L388 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-01-28 13:36:59,182 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-28 13:36:59,182 INFO L388 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 24 treesize of output 10 [2022-01-28 13:36:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:36:59,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:36:59,685 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_209 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_209 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:59,752 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_209 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_209 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:59,892 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_209 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0)) (forall ((v_ArrVal_209 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0)))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:36:59,930 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:36:59,931 INFO L388 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 82 treesize of output 74 [2022-01-28 13:36:59,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:36:59,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-28 13:37:01,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262126647] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:01,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:01,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 31] total 87 [2022-01-28 13:37:01,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492184591] [2022-01-28 13:37:01,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:01,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-01-28 13:37:01,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-01-28 13:37:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=6531, Unknown=15, NotChecked=498, Total=7482 [2022-01-28 13:37:01,768 INFO L87 Difference]: Start difference. First operand 1445 states and 3634 transitions. Second operand has 87 states, 87 states have (on average 3.6206896551724137) internal successors, (315), 87 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:06,308 INFO L93 Difference]: Finished difference Result 2522 states and 6307 transitions. [2022-01-28 13:37:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-01-28 13:37:06,308 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.6206896551724137) internal successors, (315), 87 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:37:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:06,317 INFO L225 Difference]: With dead ends: 2522 [2022-01-28 13:37:06,317 INFO L226 Difference]: Without dead ends: 2504 [2022-01-28 13:37:06,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 202 SyntacticMatches, 12 SemanticMatches, 136 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5789 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1686, Invalid=16397, Unknown=19, NotChecked=804, Total=18906 [2022-01-28 13:37:06,320 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 2161 mSDsluCounter, 7406 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 7042 SdHoareTripleChecker+Invalid, 4430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2346 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:06,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 7042 Invalid, 4430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1986 Invalid, 0 Unknown, 2346 Unchecked, 0.8s Time] [2022-01-28 13:37:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2022-01-28 13:37:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 1621. [2022-01-28 13:37:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 2.509259259259259) internal successors, (4065), 1620 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 4065 transitions. [2022-01-28 13:37:06,385 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 4065 transitions. Word has length 123 [2022-01-28 13:37:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:06,385 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 4065 transitions. [2022-01-28 13:37:06,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.6206896551724137) internal successors, (315), 87 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 4065 transitions. [2022-01-28 13:37:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:37:06,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:06,389 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:37:06,421 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-01-28 13:37:06,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:06,622 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:37:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2095360202, now seen corresponding path program 3 times [2022-01-28 13:37:06,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:06,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811287776] [2022-01-28 13:37:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:06,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:07,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811287776] [2022-01-28 13:37:07,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811287776] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385570655] [2022-01-28 13:37:07,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:37:07,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:07,578 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-01-28 13:37:07,599 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-01-28 13:37:07,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-28 13:37:07,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:07,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-28 13:37:07,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:08,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:08,538 INFO L388 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-01-28 13:37:08,657 INFO L388 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 7 [2022-01-28 13:37:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:37:08,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:08,988 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_238 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) is different from false [2022-01-28 13:37:09,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:09,160 INFO L388 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 82 treesize of output 74 [2022-01-28 13:37:09,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:37:09,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:37:10,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385570655] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:10,074 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:10,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 22, 22] total 66 [2022-01-28 13:37:10,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137765426] [2022-01-28 13:37:10,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:10,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-28 13:37:10,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-28 13:37:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3920, Unknown=1, NotChecked=126, Total=4290 [2022-01-28 13:37:10,075 INFO L87 Difference]: Start difference. First operand 1621 states and 4065 transitions. Second operand has 66 states, 66 states have (on average 4.5606060606060606) internal successors, (301), 66 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:14,014 INFO L93 Difference]: Finished difference Result 2596 states and 6425 transitions. [2022-01-28 13:37:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-28 13:37:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 4.5606060606060606) internal successors, (301), 66 states have internal predecessors, (301), 0 states have call successors, (0), 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 123 [2022-01-28 13:37:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:14,023 INFO L225 Difference]: With dead ends: 2596 [2022-01-28 13:37:14,023 INFO L226 Difference]: Without dead ends: 2435 [2022-01-28 13:37:14,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 218 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1220, Invalid=12123, Unknown=1, NotChecked=228, Total=13572 [2022-01-28 13:37:14,025 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 2205 mSDsluCounter, 5898 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 647 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:14,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2205 Valid, 5512 Invalid, 3617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2828 Invalid, 0 Unknown, 647 Unchecked, 1.2s Time] [2022-01-28 13:37:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2022-01-28 13:37:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1537. [2022-01-28 13:37:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 2.525390625) internal successors, (3879), 1536 states have internal predecessors, (3879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 3879 transitions. [2022-01-28 13:37:14,056 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 3879 transitions. Word has length 123 [2022-01-28 13:37:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:14,057 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 3879 transitions. [2022-01-28 13:37:14,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.5606060606060606) internal successors, (301), 66 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 3879 transitions. [2022-01-28 13:37:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:37:14,060 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:14,060 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:37:14,083 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-01-28 13:37:14,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:14,264 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:37:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash -976314550, now seen corresponding path program 4 times [2022-01-28 13:37:14,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726507092] [2022-01-28 13:37:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:14,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:15,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726507092] [2022-01-28 13:37:15,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726507092] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184100470] [2022-01-28 13:37:15,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:37:15,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:15,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:15,390 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-01-28 13:37:15,391 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-01-28 13:37:15,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:37:15,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:15,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-28 13:37:15,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:16,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:37:16,931 INFO L388 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-01-28 13:37:17,038 INFO L388 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 7 [2022-01-28 13:37:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:17,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:17,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_267 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_267 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0))) is different from false [2022-01-28 13:37:17,465 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0) (and (forall ((v_ArrVal_267 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_267 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)))) is different from false [2022-01-28 13:37:17,518 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0) (and (forall ((v_ArrVal_267 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_267 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)))) is different from false [2022-01-28 13:37:17,587 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0) (and (forall ((v_ArrVal_267 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_267 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)))) is different from false [2022-01-28 13:37:17,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:17,601 INFO L388 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 82 treesize of output 74 [2022-01-28 13:37:17,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:37:17,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-28 13:37:19,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184100470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:19,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:19,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 85 [2022-01-28 13:37:19,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024162876] [2022-01-28 13:37:19,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:19,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-01-28 13:37:19,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-01-28 13:37:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=6057, Unknown=9, NotChecked=644, Total=7140 [2022-01-28 13:37:19,185 INFO L87 Difference]: Start difference. First operand 1537 states and 3879 transitions. Second operand has 85 states, 85 states have (on average 3.7058823529411766) internal successors, (315), 85 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:26,265 INFO L93 Difference]: Finished difference Result 3267 states and 8256 transitions. [2022-01-28 13:37:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-28 13:37:26,266 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.7058823529411766) internal successors, (315), 85 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:37:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:26,276 INFO L225 Difference]: With dead ends: 3267 [2022-01-28 13:37:26,276 INFO L226 Difference]: Without dead ends: 3165 [2022-01-28 13:37:26,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 197 SyntacticMatches, 12 SemanticMatches, 148 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6448 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2213, Invalid=18949, Unknown=24, NotChecked=1164, Total=22350 [2022-01-28 13:37:26,278 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 3408 mSDsluCounter, 7953 mSDsCounter, 0 mSdLazyCounter, 3829 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3408 SdHoareTripleChecker+Valid, 7412 SdHoareTripleChecker+Invalid, 6746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 3829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2622 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:26,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3408 Valid, 7412 Invalid, 6746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 3829 Invalid, 0 Unknown, 2622 Unchecked, 1.4s Time] [2022-01-28 13:37:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2022-01-28 13:37:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 1576. [2022-01-28 13:37:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 2.5117460317460316) internal successors, (3956), 1575 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3956 transitions. [2022-01-28 13:37:26,308 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3956 transitions. Word has length 123 [2022-01-28 13:37:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:26,308 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 3956 transitions. [2022-01-28 13:37:26,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.7058823529411766) internal successors, (315), 85 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3956 transitions. [2022-01-28 13:37:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:37:26,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:26,312 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:37:26,333 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-01-28 13:37:26,528 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,SelfDestructingSolverStorable11 [2022-01-28 13:37:26,529 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:37:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -854331734, now seen corresponding path program 5 times [2022-01-28 13:37:26,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:26,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078014632] [2022-01-28 13:37:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:26,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:27,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078014632] [2022-01-28 13:37:27,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078014632] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:27,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967782387] [2022-01-28 13:37:27,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:37:27,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:27,530 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-01-28 13:37:27,531 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-01-28 13:37:27,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-28 13:37:27,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:27,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-28 13:37:27,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:27,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:37:27,764 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:37:27,764 INFO L388 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-01-28 13:37:28,349 INFO L388 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-01-28 13:37:28,473 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-28 13:37:28,474 INFO L388 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 10 [2022-01-28 13:37:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:37:28,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:29,030 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~q_back~0 c_~q_front~0) (and (forall ((v_ArrVal_297 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_297 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (< c_~q_front~0 0)) is different from false [2022-01-28 13:37:29,094 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_297 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_297 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (< c_~q_front~0 0)) is different from false [2022-01-28 13:37:29,107 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (and (forall ((v_ArrVal_297 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_297 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:37:29,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:29,122 INFO L388 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 82 treesize of output 74 [2022-01-28 13:37:29,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:37:29,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:30,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:37:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:37:30,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967782387] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:30,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:30,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 22, 22] total 67 [2022-01-28 13:37:30,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818010206] [2022-01-28 13:37:30,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:30,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-28 13:37:30,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-28 13:37:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3816, Unknown=3, NotChecked=378, Total=4422 [2022-01-28 13:37:30,604 INFO L87 Difference]: Start difference. First operand 1576 states and 3956 transitions. Second operand has 67 states, 67 states have (on average 4.492537313432836) internal successors, (301), 67 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:35,431 INFO L93 Difference]: Finished difference Result 3058 states and 7776 transitions. [2022-01-28 13:37:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-28 13:37:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.492537313432836) internal successors, (301), 67 states have internal predecessors, (301), 0 states have call successors, (0), 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 123 [2022-01-28 13:37:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:35,451 INFO L225 Difference]: With dead ends: 3058 [2022-01-28 13:37:35,451 INFO L226 Difference]: Without dead ends: 2645 [2022-01-28 13:37:35,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 224 SyntacticMatches, 12 SemanticMatches, 132 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4954 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1444, Invalid=15595, Unknown=3, NotChecked=780, Total=17822 [2022-01-28 13:37:35,453 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 1708 mSDsluCounter, 6607 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 6336 SdHoareTripleChecker+Invalid, 4059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1569 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:35,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1708 Valid, 6336 Invalid, 4059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2395 Invalid, 0 Unknown, 1569 Unchecked, 0.9s Time] [2022-01-28 13:37:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2022-01-28 13:37:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1766. [2022-01-28 13:37:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 2.536543909348442) internal successors, (4477), 1765 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4477 transitions. [2022-01-28 13:37:35,511 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4477 transitions. Word has length 123 [2022-01-28 13:37:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:35,512 INFO L470 AbstractCegarLoop]: Abstraction has 1766 states and 4477 transitions. [2022-01-28 13:37:35,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.492537313432836) internal successors, (301), 67 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4477 transitions. [2022-01-28 13:37:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:37:35,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:35,531 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:37:35,548 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-01-28 13:37:35,747 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,SelfDestructingSolverStorable12 [2022-01-28 13:37:35,747 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:37:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:35,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1340828470, now seen corresponding path program 6 times [2022-01-28 13:37:35,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:35,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793874191] [2022-01-28 13:37:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:35,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:36,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793874191] [2022-01-28 13:37:36,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793874191] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:36,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256517184] [2022-01-28 13:37:36,746 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:37:36,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:36,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:36,747 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-01-28 13:37:36,751 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-01-28 13:37:36,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:37:36,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:37:36,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-28 13:37:36,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:36,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:37:37,139 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:37:37,139 INFO L388 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-01-28 13:37:38,169 INFO L388 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-01-28 13:37:38,303 INFO L388 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 7 [2022-01-28 13:37:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:38,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:38,981 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_327 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_327 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:39,046 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_327 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_327 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:39,064 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_327 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_327 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:39,078 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:39,078 INFO L388 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 82 treesize of output 74 [2022-01-28 13:37:39,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:37:39,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:40,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:37:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:40,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256517184] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:40,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:40,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 84 [2022-01-28 13:37:40,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960486906] [2022-01-28 13:37:40,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:40,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-28 13:37:40,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-28 13:37:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=5989, Unknown=3, NotChecked=480, Total=6972 [2022-01-28 13:37:40,681 INFO L87 Difference]: Start difference. First operand 1766 states and 4477 transitions. Second operand has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:37:48,577 INFO L93 Difference]: Finished difference Result 4270 states and 10849 transitions. [2022-01-28 13:37:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-01-28 13:37:48,578 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:37:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:37:48,585 INFO L225 Difference]: With dead ends: 4270 [2022-01-28 13:37:48,585 INFO L226 Difference]: Without dead ends: 3967 [2022-01-28 13:37:48,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 209 SyntacticMatches, 18 SemanticMatches, 160 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2959, Invalid=22164, Unknown=11, NotChecked=948, Total=26082 [2022-01-28 13:37:48,587 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 3619 mSDsluCounter, 7433 mSDsCounter, 0 mSdLazyCounter, 3555 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3619 SdHoareTripleChecker+Valid, 6923 SdHoareTripleChecker+Invalid, 5932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 3555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2033 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:37:48,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3619 Valid, 6923 Invalid, 5932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 3555 Invalid, 0 Unknown, 2033 Unchecked, 1.4s Time] [2022-01-28 13:37:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2022-01-28 13:37:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 1826. [2022-01-28 13:37:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 2.5435616438356163) internal successors, (4642), 1825 states have internal predecessors, (4642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 4642 transitions. [2022-01-28 13:37:48,621 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 4642 transitions. Word has length 123 [2022-01-28 13:37:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:37:48,622 INFO L470 AbstractCegarLoop]: Abstraction has 1826 states and 4642 transitions. [2022-01-28 13:37:48,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:37:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 4642 transitions. [2022-01-28 13:37:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:37:48,625 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:37:48,625 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:37:48,646 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-01-28 13:37:48,846 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,SelfDestructingSolverStorable13 [2022-01-28 13:37:48,847 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:37:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:37:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash -810432270, now seen corresponding path program 7 times [2022-01-28 13:37:48,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:37:48,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525662583] [2022-01-28 13:37:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:37:48,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:37:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:49,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:37:49,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525662583] [2022-01-28 13:37:49,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525662583] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:37:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379060953] [2022-01-28 13:37:49,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:37:49,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:37:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:37:49,767 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-01-28 13:37:49,767 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-01-28 13:37:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:37:49,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-28 13:37:49,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:37:49,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:37:50,042 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:37:50,042 INFO L388 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-01-28 13:37:50,822 INFO L388 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 19 treesize of output 21 [2022-01-28 13:37:50,973 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-28 13:37:50,973 INFO L388 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 24 treesize of output 10 [2022-01-28 13:37:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:51,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:37:51,643 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_357 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_357 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:51,719 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_357 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_357 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:51,734 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_357 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_357 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:37:51,748 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:37:51,749 INFO L388 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 82 treesize of output 74 [2022-01-28 13:37:51,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:37:51,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:37:53,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:37:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:37:53,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379060953] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:37:53,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:37:53,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 83 [2022-01-28 13:37:53,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584623486] [2022-01-28 13:37:53,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:37:53,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-01-28 13:37:53,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:37:53,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-01-28 13:37:53,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=5827, Unknown=3, NotChecked=474, Total=6806 [2022-01-28 13:37:53,521 INFO L87 Difference]: Start difference. First operand 1826 states and 4642 transitions. Second operand has 83 states, 83 states have (on average 3.6506024096385543) internal successors, (303), 83 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:01,276 INFO L93 Difference]: Finished difference Result 4048 states and 10261 transitions. [2022-01-28 13:38:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-01-28 13:38:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.6506024096385543) internal successors, (303), 83 states have internal predecessors, (303), 0 states have call successors, (0), 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 123 [2022-01-28 13:38:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:01,297 INFO L225 Difference]: With dead ends: 4048 [2022-01-28 13:38:01,297 INFO L226 Difference]: Without dead ends: 3821 [2022-01-28 13:38:01,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 201 SyntacticMatches, 20 SemanticMatches, 156 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8232 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2685, Invalid=21176, Unknown=21, NotChecked=924, Total=24806 [2022-01-28 13:38:01,298 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 3393 mSDsluCounter, 7104 mSDsCounter, 0 mSdLazyCounter, 3544 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3393 SdHoareTripleChecker+Valid, 6619 SdHoareTripleChecker+Invalid, 6115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 3544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2193 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:01,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3393 Valid, 6619 Invalid, 6115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 3544 Invalid, 0 Unknown, 2193 Unchecked, 1.3s Time] [2022-01-28 13:38:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-01-28 13:38:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 1764. [2022-01-28 13:38:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.540555870674986) internal successors, (4479), 1763 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4479 transitions. [2022-01-28 13:38:01,335 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 4479 transitions. Word has length 123 [2022-01-28 13:38:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:01,335 INFO L470 AbstractCegarLoop]: Abstraction has 1764 states and 4479 transitions. [2022-01-28 13:38:01,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.6506024096385543) internal successors, (303), 83 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 4479 transitions. [2022-01-28 13:38:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:01,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:01,338 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:01,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-28 13:38:01,570 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,SelfDestructingSolverStorable14 [2022-01-28 13:38:01,571 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:01,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1294464682, now seen corresponding path program 8 times [2022-01-28 13:38:01,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97111722] [2022-01-28 13:38:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:01,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:02,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97111722] [2022-01-28 13:38:02,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97111722] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30547747] [2022-01-28 13:38:02,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:38:02,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:02,642 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-01-28 13:38:02,644 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-01-28 13:38:02,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:38:02,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:02,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-28 13:38:02,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:03,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:38:03,571 INFO L388 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-01-28 13:38:03,656 INFO L388 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 7 [2022-01-28 13:38:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:03,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:04,395 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_386 (Array Int Int))) (<= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0))) (forall ((v_ArrVal_386 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))) c_~s~0) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:38:04,408 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:04,409 INFO L388 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 82 treesize of output 74 [2022-01-28 13:38:04,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:38:04,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:38:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:05,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30547747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:05,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:05,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 84 [2022-01-28 13:38:05,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849988586] [2022-01-28 13:38:05,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:05,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-28 13:38:05,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-28 13:38:05,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=6294, Unknown=28, NotChecked=162, Total=6972 [2022-01-28 13:38:05,870 INFO L87 Difference]: Start difference. First operand 1764 states and 4479 transitions. Second operand has 84 states, 84 states have (on average 3.6547619047619047) internal successors, (307), 84 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:15,404 INFO L93 Difference]: Finished difference Result 4206 states and 10712 transitions. [2022-01-28 13:38:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-01-28 13:38:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.6547619047619047) internal successors, (307), 84 states have internal predecessors, (307), 0 states have call successors, (0), 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 123 [2022-01-28 13:38:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:15,412 INFO L225 Difference]: With dead ends: 4206 [2022-01-28 13:38:15,412 INFO L226 Difference]: Without dead ends: 3878 [2022-01-28 13:38:15,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 200 SyntacticMatches, 10 SemanticMatches, 162 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7331 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3144, Invalid=23223, Unknown=43, NotChecked=322, Total=26732 [2022-01-28 13:38:15,413 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 5023 mSDsluCounter, 7379 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 6950 SdHoareTripleChecker+Invalid, 5281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 912 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:15,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5023 Valid, 6950 Invalid, 5281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 3750 Invalid, 0 Unknown, 912 Unchecked, 1.6s Time] [2022-01-28 13:38:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-01-28 13:38:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 1781. [2022-01-28 13:38:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1780 states have (on average 2.5376404494382023) internal successors, (4517), 1780 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 4517 transitions. [2022-01-28 13:38:15,456 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 4517 transitions. Word has length 123 [2022-01-28 13:38:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:15,457 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 4517 transitions. [2022-01-28 13:38:15,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.6547619047619047) internal successors, (307), 84 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 4517 transitions. [2022-01-28 13:38:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:15,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:15,460 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:15,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-28 13:38:15,677 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,SelfDestructingSolverStorable15 [2022-01-28 13:38:15,677 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:15,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 807967946, now seen corresponding path program 9 times [2022-01-28 13:38:15,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:15,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782991877] [2022-01-28 13:38:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:15,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:16,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:16,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782991877] [2022-01-28 13:38:16,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782991877] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:16,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450514195] [2022-01-28 13:38:16,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:38:16,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:16,710 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-01-28 13:38:16,711 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-01-28 13:38:16,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-28 13:38:16,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:16,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-28 13:38:16,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:16,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:38:16,992 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:38:16,993 INFO L388 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-01-28 13:38:17,509 INFO L388 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-01-28 13:38:17,582 INFO L388 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 7 [2022-01-28 13:38:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:38:17,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:18,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:18,410 INFO L388 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 111 treesize of output 95 [2022-01-28 13:38:18,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:38:18,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:38:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:38:18,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450514195] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:18,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:18,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 23] total 62 [2022-01-28 13:38:18,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231412507] [2022-01-28 13:38:18,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:18,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-28 13:38:18,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-28 13:38:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3570, Unknown=3, NotChecked=0, Total=3782 [2022-01-28 13:38:18,978 INFO L87 Difference]: Start difference. First operand 1781 states and 4517 transitions. Second operand has 62 states, 62 states have (on average 4.274193548387097) internal successors, (265), 62 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:23,127 INFO L93 Difference]: Finished difference Result 2864 states and 7265 transitions. [2022-01-28 13:38:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-28 13:38:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.274193548387097) internal successors, (265), 62 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-01-28 13:38:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:23,133 INFO L225 Difference]: With dead ends: 2864 [2022-01-28 13:38:23,133 INFO L226 Difference]: Without dead ends: 2458 [2022-01-28 13:38:23,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4837 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1421, Invalid=16936, Unknown=3, NotChecked=0, Total=18360 [2022-01-28 13:38:23,135 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 1832 mSDsluCounter, 5915 mSDsCounter, 0 mSdLazyCounter, 3089 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 3089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:23,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1832 Valid, 5599 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 3089 Invalid, 0 Unknown, 529 Unchecked, 1.0s Time] [2022-01-28 13:38:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2022-01-28 13:38:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 1805. [2022-01-28 13:38:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1804 states have (on average 2.5382483370288247) internal successors, (4579), 1804 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 4579 transitions. [2022-01-28 13:38:23,166 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 4579 transitions. Word has length 123 [2022-01-28 13:38:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:23,166 INFO L470 AbstractCegarLoop]: Abstraction has 1805 states and 4579 transitions. [2022-01-28 13:38:23,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.274193548387097) internal successors, (265), 62 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 4579 transitions. [2022-01-28 13:38:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:23,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:23,170 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:23,199 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-01-28 13:38:23,402 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,SelfDestructingSolverStorable16 [2022-01-28 13:38:23,402 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 349498376, now seen corresponding path program 10 times [2022-01-28 13:38:23,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:23,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680653955] [2022-01-28 13:38:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:23,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:24,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680653955] [2022-01-28 13:38:24,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680653955] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031748551] [2022-01-28 13:38:24,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:38:24,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:24,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:24,098 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-01-28 13:38:24,099 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-01-28 13:38:24,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:38:24,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:24,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-28 13:38:24,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:25,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:38:25,461 INFO L388 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-01-28 13:38:25,586 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-28 13:38:25,587 INFO L388 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 10 [2022-01-28 13:38:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:25,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:26,132 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_445 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_445) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_445 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_445) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:38:26,169 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_445 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_445) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_445 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_445) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:38:26,185 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:26,185 INFO L388 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 82 treesize of output 74 [2022-01-28 13:38:26,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:38:26,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:38:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:27,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031748551] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:27,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:27,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 82 [2022-01-28 13:38:27,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243301231] [2022-01-28 13:38:27,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:27,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-28 13:38:27,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-28 13:38:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=5834, Unknown=2, NotChecked=314, Total=6642 [2022-01-28 13:38:27,374 INFO L87 Difference]: Start difference. First operand 1805 states and 4579 transitions. Second operand has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:31,912 INFO L93 Difference]: Finished difference Result 3227 states and 8082 transitions. [2022-01-28 13:38:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-28 13:38:31,923 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 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 123 [2022-01-28 13:38:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:31,929 INFO L225 Difference]: With dead ends: 3227 [2022-01-28 13:38:31,929 INFO L226 Difference]: Without dead ends: 2887 [2022-01-28 13:38:31,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 198 SyntacticMatches, 13 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5767 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1902, Invalid=16460, Unknown=6, NotChecked=538, Total=18906 [2022-01-28 13:38:31,931 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 2066 mSDsluCounter, 6991 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:31,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2066 Valid, 6713 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2657 Invalid, 0 Unknown, 780 Unchecked, 1.0s Time] [2022-01-28 13:38:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2022-01-28 13:38:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1844. [2022-01-28 13:38:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 2.5371676614215954) internal successors, (4676), 1843 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4676 transitions. [2022-01-28 13:38:31,964 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4676 transitions. Word has length 123 [2022-01-28 13:38:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:31,964 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 4676 transitions. [2022-01-28 13:38:31,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.6951219512195124) internal successors, (303), 82 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4676 transitions. [2022-01-28 13:38:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:31,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:31,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:31,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-28 13:38:32,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:32,187 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -383809788, now seen corresponding path program 11 times [2022-01-28 13:38:32,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:32,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481730224] [2022-01-28 13:38:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:32,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:33,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481730224] [2022-01-28 13:38:33,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481730224] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:33,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686350795] [2022-01-28 13:38:33,284 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:38:33,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:33,285 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-01-28 13:38:33,286 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-01-28 13:38:33,349 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-28 13:38:33,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:33,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-28 13:38:33,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:33,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:38:33,522 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:38:33,522 INFO L388 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-01-28 13:38:33,927 INFO L388 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-01-28 13:38:34,010 INFO L388 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 25 treesize of output 7 [2022-01-28 13:38:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:38:34,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:34,595 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:34,596 INFO L388 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 111 treesize of output 95 [2022-01-28 13:38:34,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:38:35,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:38:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:38:35,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686350795] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:35,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:35,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25, 23] total 66 [2022-01-28 13:38:35,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413512642] [2022-01-28 13:38:35,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:35,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-28 13:38:35,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-28 13:38:35,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4059, Unknown=2, NotChecked=0, Total=4290 [2022-01-28 13:38:35,320 INFO L87 Difference]: Start difference. First operand 1844 states and 4676 transitions. Second operand has 66 states, 66 states have (on average 4.136363636363637) internal successors, (273), 66 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-01-28 13:38:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:39,795 INFO L93 Difference]: Finished difference Result 2866 states and 7270 transitions. [2022-01-28 13:38:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-28 13:38:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 4.136363636363637) internal successors, (273), 66 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 123 [2022-01-28 13:38:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:39,800 INFO L225 Difference]: With dead ends: 2866 [2022-01-28 13:38:39,800 INFO L226 Difference]: Without dead ends: 2616 [2022-01-28 13:38:39,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3743 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1134, Invalid=13384, Unknown=2, NotChecked=0, Total=14520 [2022-01-28 13:38:39,802 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 1515 mSDsluCounter, 6322 mSDsCounter, 0 mSdLazyCounter, 3609 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 3893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:39,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 6015 Invalid, 3893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3609 Invalid, 0 Unknown, 187 Unchecked, 1.4s Time] [2022-01-28 13:38:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-01-28 13:38:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 1817. [2022-01-28 13:38:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 2.537444933920705) internal successors, (4608), 1816 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 4608 transitions. [2022-01-28 13:38:39,829 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 4608 transitions. Word has length 123 [2022-01-28 13:38:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:39,829 INFO L470 AbstractCegarLoop]: Abstraction has 1817 states and 4608 transitions. [2022-01-28 13:38:39,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.136363636363637) internal successors, (273), 66 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-01-28 13:38:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 4608 transitions. [2022-01-28 13:38:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:39,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:39,832 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:39,851 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-01-28 13:38:40,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:40,049 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1025385696, now seen corresponding path program 12 times [2022-01-28 13:38:40,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:40,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419634961] [2022-01-28 13:38:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:40,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:40,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419634961] [2022-01-28 13:38:40,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419634961] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116822989] [2022-01-28 13:38:40,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:38:40,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:40,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:40,730 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-01-28 13:38:40,731 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-01-28 13:38:40,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:38:40,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:38:40,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-28 13:38:40,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:40,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:38:41,116 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:38:41,116 INFO L388 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-01-28 13:38:41,983 INFO L388 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-01-28 13:38:42,111 INFO L388 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 7 [2022-01-28 13:38:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:42,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:43,036 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_505 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_505 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_505) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:38:43,129 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:43,130 INFO L388 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 82 treesize of output 74 [2022-01-28 13:38:43,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:38:43,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:38:44,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:38:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:44,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116822989] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:44,838 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:44,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 84 [2022-01-28 13:38:44,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936363923] [2022-01-28 13:38:44,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:44,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-28 13:38:44,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-28 13:38:44,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=6297, Unknown=1, NotChecked=162, Total=6972 [2022-01-28 13:38:44,840 INFO L87 Difference]: Start difference. First operand 1817 states and 4608 transitions. Second operand has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:38:50,697 INFO L93 Difference]: Finished difference Result 2889 states and 7340 transitions. [2022-01-28 13:38:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-28 13:38:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:38:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:38:50,702 INFO L225 Difference]: With dead ends: 2889 [2022-01-28 13:38:50,702 INFO L226 Difference]: Without dead ends: 2586 [2022-01-28 13:38:50,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 201 SyntacticMatches, 5 SemanticMatches, 147 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6417 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2066, Invalid=19691, Unknown=3, NotChecked=292, Total=22052 [2022-01-28 13:38:50,705 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 3179 mSDsluCounter, 6474 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3179 SdHoareTripleChecker+Valid, 6151 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 784 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:38:50,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3179 Valid, 6151 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2810 Invalid, 0 Unknown, 784 Unchecked, 1.2s Time] [2022-01-28 13:38:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-01-28 13:38:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1817. [2022-01-28 13:38:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 2.541850220264317) internal successors, (4616), 1816 states have internal predecessors, (4616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 4616 transitions. [2022-01-28 13:38:50,737 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 4616 transitions. Word has length 123 [2022-01-28 13:38:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:38:50,737 INFO L470 AbstractCegarLoop]: Abstraction has 1817 states and 4616 transitions. [2022-01-28 13:38:50,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:38:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 4616 transitions. [2022-01-28 13:38:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:38:50,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:38:50,740 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:38:50,757 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-01-28 13:38:50,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:50,957 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:38:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:38:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1483855266, now seen corresponding path program 13 times [2022-01-28 13:38:50,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:38:50,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610688654] [2022-01-28 13:38:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:38:50,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:38:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:51,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:38:51,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610688654] [2022-01-28 13:38:51,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610688654] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:38:51,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837075071] [2022-01-28 13:38:51,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:38:51,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:38:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:38:51,922 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-01-28 13:38:51,923 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-01-28 13:38:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:38:52,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-28 13:38:52,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:38:52,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:38:52,990 INFO L388 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 19 treesize of output 21 [2022-01-28 13:38:53,098 INFO L388 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 25 treesize of output 7 [2022-01-28 13:38:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:53,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:38:53,846 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0) (and (forall ((v_ArrVal_534 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_534 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_534) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))))) is different from false [2022-01-28 13:38:53,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:38:53,894 INFO L388 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 82 treesize of output 74 [2022-01-28 13:38:53,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:38:53,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:38:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:38:55,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837075071] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:38:55,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:38:55,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 84 [2022-01-28 13:38:55,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490647631] [2022-01-28 13:38:55,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:38:55,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-28 13:38:55,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:38:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-28 13:38:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=6307, Unknown=1, NotChecked=162, Total=6972 [2022-01-28 13:38:55,304 INFO L87 Difference]: Start difference. First operand 1817 states and 4616 transitions. Second operand has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:02,484 INFO L93 Difference]: Finished difference Result 3264 states and 8337 transitions. [2022-01-28 13:39:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-01-28 13:39:02,485 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:39:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:02,489 INFO L225 Difference]: With dead ends: 3264 [2022-01-28 13:39:02,489 INFO L226 Difference]: Without dead ends: 2948 [2022-01-28 13:39:02,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 193 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7004 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2525, Invalid=21346, Unknown=3, NotChecked=306, Total=24180 [2022-01-28 13:39:02,492 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 3067 mSDsluCounter, 7306 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 6982 SdHoareTripleChecker+Invalid, 4530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:02,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3067 Valid, 6982 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3881 Invalid, 0 Unknown, 417 Unchecked, 1.5s Time] [2022-01-28 13:39:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2022-01-28 13:39:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1827. [2022-01-28 13:39:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 2.54052573932092) internal successors, (4639), 1826 states have internal predecessors, (4639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 4639 transitions. [2022-01-28 13:39:02,535 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 4639 transitions. Word has length 123 [2022-01-28 13:39:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:02,535 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 4639 transitions. [2022-01-28 13:39:02,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 4639 transitions. [2022-01-28 13:39:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-01-28 13:39:02,539 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:02,539 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-28 13:39:02,572 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-01-28 13:39:02,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:02,756 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1278814812, now seen corresponding path program 14 times [2022-01-28 13:39:02,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:02,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171420217] [2022-01-28 13:39:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:02,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:03,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171420217] [2022-01-28 13:39:03,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171420217] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433387664] [2022-01-28 13:39:03,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:39:03,661 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:03,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:03,668 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-01-28 13:39:03,670 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-01-28 13:39:03,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:39:03,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:39:03,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-28 13:39:03,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:39:04,741 INFO L388 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-01-28 13:39:04,850 INFO L388 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 7 [2022-01-28 13:39:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:05,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:05,697 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_back~0) (and (forall ((v_ArrVal_563 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_563 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:39:05,765 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:05,766 INFO L388 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 82 treesize of output 74 [2022-01-28 13:39:05,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:39:05,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:39:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:07,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433387664] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:07,211 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:07,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 84 [2022-01-28 13:39:07,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461098917] [2022-01-28 13:39:07,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:07,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-01-28 13:39:07,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-01-28 13:39:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=6299, Unknown=1, NotChecked=162, Total=6972 [2022-01-28 13:39:07,213 INFO L87 Difference]: Start difference. First operand 1827 states and 4639 transitions. Second operand has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:13,274 INFO L93 Difference]: Finished difference Result 2990 states and 7614 transitions. [2022-01-28 13:39:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-28 13:39:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 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 123 [2022-01-28 13:39:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:13,278 INFO L225 Difference]: With dead ends: 2990 [2022-01-28 13:39:13,278 INFO L226 Difference]: Without dead ends: 2662 [2022-01-28 13:39:13,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 193 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6757 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2445, Invalid=20206, Unknown=3, NotChecked=298, Total=22952 [2022-01-28 13:39:13,280 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 3406 mSDsluCounter, 6870 mSDsCounter, 0 mSdLazyCounter, 3555 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3406 SdHoareTripleChecker+Valid, 6511 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 3555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 453 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:13,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3406 Valid, 6511 Invalid, 4299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 3555 Invalid, 0 Unknown, 453 Unchecked, 1.3s Time] [2022-01-28 13:39:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2022-01-28 13:39:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1780. [2022-01-28 13:39:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 2.5413153456998314) internal successors, (4521), 1779 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 4521 transitions. [2022-01-28 13:39:13,308 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 4521 transitions. Word has length 123 [2022-01-28 13:39:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:13,308 INFO L470 AbstractCegarLoop]: Abstraction has 1780 states and 4521 transitions. [2022-01-28 13:39:13,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.75) internal successors, (315), 84 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 4521 transitions. [2022-01-28 13:39:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-28 13:39:13,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:13,311 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2022-01-28 13:39:13,328 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-01-28 13:39:13,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:13,526 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2064524892, now seen corresponding path program 15 times [2022-01-28 13:39:13,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:13,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293354706] [2022-01-28 13:39:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:13,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-28 13:39:13,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:13,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293354706] [2022-01-28 13:39:13,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293354706] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:13,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842628181] [2022-01-28 13:39:13,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:39:13,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:13,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:13,600 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-01-28 13:39:13,629 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-01-28 13:39:13,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:39:13,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:39:13,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-28 13:39:13,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-28 13:39:13,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:39:14,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842628181] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:14,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:14,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-01-28 13:39:14,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999689382] [2022-01-28 13:39:14,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:14,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 13:39:14,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:14,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 13:39:14,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-28 13:39:14,273 INFO L87 Difference]: Start difference. First operand 1780 states and 4521 transitions. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:14,316 INFO L93 Difference]: Finished difference Result 3013 states and 7697 transitions. [2022-01-28 13:39:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 13:39:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 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 127 [2022-01-28 13:39:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:14,321 INFO L225 Difference]: With dead ends: 3013 [2022-01-28 13:39:14,321 INFO L226 Difference]: Without dead ends: 2671 [2022-01-28 13:39:14,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:39:14,321 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 514 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:14,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 351 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 13:39:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2022-01-28 13:39:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 1933. [2022-01-28 13:39:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1932 states have (on average 2.5936853002070395) internal successors, (5011), 1932 states have internal predecessors, (5011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 5011 transitions. [2022-01-28 13:39:14,352 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 5011 transitions. Word has length 127 [2022-01-28 13:39:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:14,353 INFO L470 AbstractCegarLoop]: Abstraction has 1933 states and 5011 transitions. [2022-01-28 13:39:14,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 5011 transitions. [2022-01-28 13:39:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:39:14,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:14,356 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:39:14,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-28 13:39:14,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:14,574 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1967187257, now seen corresponding path program 16 times [2022-01-28 13:39:14,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:14,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253267286] [2022-01-28 13:39:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:14,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:15,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:15,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253267286] [2022-01-28 13:39:15,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253267286] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:15,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874541837] [2022-01-28 13:39:15,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:39:15,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:15,965 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-01-28 13:39:15,965 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-01-28 13:39:16,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:39:16,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:39:16,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-28 13:39:16,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:17,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:39:17,265 INFO L388 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-01-28 13:39:17,335 INFO L388 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 7 [2022-01-28 13:39:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:17,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:17,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) is different from false [2022-01-28 13:39:17,618 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:39:17,645 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:39:17,662 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:39:17,676 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:39:17,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:17,687 INFO L388 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 86 treesize of output 78 [2022-01-28 13:39:17,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-01-28 13:39:17,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-01-28 13:39:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-28 13:39:19,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874541837] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:19,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:19,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 89 [2022-01-28 13:39:19,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729584561] [2022-01-28 13:39:19,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:19,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-01-28 13:39:19,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-01-28 13:39:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=6574, Unknown=5, NotChecked=840, Total=7832 [2022-01-28 13:39:19,400 INFO L87 Difference]: Start difference. First operand 1933 states and 5011 transitions. Second operand has 89 states, 89 states have (on average 3.764044943820225) internal successors, (335), 89 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-01-28 13:39:23,693 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (and (forall ((v_ArrVal_624 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))))) (forall ((v_ArrVal_624 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_624) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) (+ c_~N~0 1)))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) (= c_~s~0 0)) is different from false [2022-01-28 13:39:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:26,648 INFO L93 Difference]: Finished difference Result 4424 states and 11174 transitions. [2022-01-28 13:39:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-01-28 13:39:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.764044943820225) internal successors, (335), 89 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 130 [2022-01-28 13:39:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:26,653 INFO L225 Difference]: With dead ends: 4424 [2022-01-28 13:39:26,654 INFO L226 Difference]: Without dead ends: 3750 [2022-01-28 13:39:26,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 204 SyntacticMatches, 17 SemanticMatches, 166 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 8735 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2382, Invalid=23718, Unknown=6, NotChecked=1950, Total=28056 [2022-01-28 13:39:26,655 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 3872 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 4875 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3872 SdHoareTripleChecker+Valid, 7965 SdHoareTripleChecker+Invalid, 9576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 4875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4335 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:26,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3872 Valid, 7965 Invalid, 9576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 4875 Invalid, 0 Unknown, 4335 Unchecked, 1.8s Time] [2022-01-28 13:39:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2022-01-28 13:39:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 2569. [2022-01-28 13:39:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2568 states have (on average 2.5623052959501558) internal successors, (6580), 2568 states have internal predecessors, (6580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 6580 transitions. [2022-01-28 13:39:26,696 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 6580 transitions. Word has length 130 [2022-01-28 13:39:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:26,696 INFO L470 AbstractCegarLoop]: Abstraction has 2569 states and 6580 transitions. [2022-01-28 13:39:26,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.764044943820225) internal successors, (335), 89 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-01-28 13:39:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 6580 transitions. [2022-01-28 13:39:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:39:26,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:26,700 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:39:26,719 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-01-28 13:39:26,915 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,SelfDestructingSolverStorable23 [2022-01-28 13:39:26,916 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash 925643967, now seen corresponding path program 17 times [2022-01-28 13:39:26,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795533759] [2022-01-28 13:39:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:26,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:28,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:28,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795533759] [2022-01-28 13:39:28,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795533759] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:28,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235502718] [2022-01-28 13:39:28,195 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:39:28,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:28,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:28,196 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-01-28 13:39:28,197 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-01-28 13:39:28,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:39:28,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:39:28,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-28 13:39:28,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:28,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:39:28,401 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:39:28,401 INFO L388 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-01-28 13:39:28,889 INFO L388 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-01-28 13:39:29,006 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-28 13:39:29,007 INFO L388 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 10 [2022-01-28 13:39:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:39:29,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:29,862 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:29,862 INFO L388 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 111 treesize of output 95 [2022-01-28 13:39:29,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:39:31,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:39:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:39:31,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235502718] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:31,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:31,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 23] total 67 [2022-01-28 13:39:31,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875068208] [2022-01-28 13:39:31,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:31,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-28 13:39:31,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-28 13:39:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=4016, Unknown=2, NotChecked=0, Total=4422 [2022-01-28 13:39:31,056 INFO L87 Difference]: Start difference. First operand 2569 states and 6580 transitions. Second operand has 67 states, 67 states have (on average 4.343283582089552) internal successors, (291), 67 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:34,153 INFO L93 Difference]: Finished difference Result 3896 states and 10013 transitions. [2022-01-28 13:39:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-28 13:39:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 4.343283582089552) internal successors, (291), 67 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-28 13:39:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:34,159 INFO L225 Difference]: With dead ends: 3896 [2022-01-28 13:39:34,159 INFO L226 Difference]: Without dead ends: 3735 [2022-01-28 13:39:34,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3814 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1348, Invalid=11306, Unknown=2, NotChecked=0, Total=12656 [2022-01-28 13:39:34,160 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1172 mSDsluCounter, 4714 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 2613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:34,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1172 Valid, 4472 Invalid, 2613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1556 Invalid, 0 Unknown, 1009 Unchecked, 0.6s Time] [2022-01-28 13:39:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-01-28 13:39:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 2735. [2022-01-28 13:39:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 2.570958302852963) internal successors, (7029), 2734 states have internal predecessors, (7029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 7029 transitions. [2022-01-28 13:39:34,200 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 7029 transitions. Word has length 130 [2022-01-28 13:39:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:34,200 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 7029 transitions. [2022-01-28 13:39:34,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.343283582089552) internal successors, (291), 67 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 7029 transitions. [2022-01-28 13:39:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:39:34,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:34,204 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:39:34,235 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-01-28 13:39:34,420 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,SelfDestructingSolverStorable24 [2022-01-28 13:39:34,420 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 969543431, now seen corresponding path program 18 times [2022-01-28 13:39:34,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:34,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509593329] [2022-01-28 13:39:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:34,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:36,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:36,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509593329] [2022-01-28 13:39:36,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509593329] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:36,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997569964] [2022-01-28 13:39:36,172 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:39:36,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:36,173 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-01-28 13:39:36,174 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-01-28 13:39:36,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:39:36,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:39:36,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-28 13:39:36,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:37,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:39:37,046 INFO L388 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-01-28 13:39:37,109 INFO L388 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 7 [2022-01-28 13:39:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:39:37,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:37,698 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:37,699 INFO L388 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 82 treesize of output 74 [2022-01-28 13:39:37,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:39:37,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:39:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:39:38,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997569964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:38,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:38,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22, 22] total 68 [2022-01-28 13:39:38,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246830815] [2022-01-28 13:39:38,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:38,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-28 13:39:38,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-28 13:39:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4290, Unknown=4, NotChecked=0, Total=4556 [2022-01-28 13:39:38,630 INFO L87 Difference]: Start difference. First operand 2735 states and 7029 transitions. Second operand has 68 states, 68 states have (on average 4.529411764705882) internal successors, (308), 68 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:39:43,805 INFO L93 Difference]: Finished difference Result 4060 states and 10540 transitions. [2022-01-28 13:39:43,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-01-28 13:39:43,805 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.529411764705882) internal successors, (308), 68 states have internal predecessors, (308), 0 states have call successors, (0), 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 130 [2022-01-28 13:39:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:39:43,811 INFO L225 Difference]: With dead ends: 4060 [2022-01-28 13:39:43,811 INFO L226 Difference]: Without dead ends: 3811 [2022-01-28 13:39:43,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 229 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4887 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1709, Invalid=17467, Unknown=6, NotChecked=0, Total=19182 [2022-01-28 13:39:43,812 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 1972 mSDsluCounter, 5050 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 3168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:39:43,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1972 Valid, 4789 Invalid, 3168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2680 Invalid, 0 Unknown, 332 Unchecked, 1.1s Time] [2022-01-28 13:39:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2022-01-28 13:39:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2501. [2022-01-28 13:39:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 2.5552) internal successors, (6388), 2500 states have internal predecessors, (6388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 6388 transitions. [2022-01-28 13:39:43,865 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 6388 transitions. Word has length 130 [2022-01-28 13:39:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:39:43,865 INFO L470 AbstractCegarLoop]: Abstraction has 2501 states and 6388 transitions. [2022-01-28 13:39:43,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.529411764705882) internal successors, (308), 68 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:39:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 6388 transitions. [2022-01-28 13:39:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:39:43,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:39:43,869 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:39:43,887 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-01-28 13:39:44,086 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,SelfDestructingSolverStorable25 [2022-01-28 13:39:44,087 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:39:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:39:44,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2023052441, now seen corresponding path program 19 times [2022-01-28 13:39:44,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:39:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171008967] [2022-01-28 13:39:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:39:44,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:39:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:45,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:39:45,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171008967] [2022-01-28 13:39:45,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171008967] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:39:45,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728547902] [2022-01-28 13:39:45,296 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:39:45,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:39:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:39:45,297 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-01-28 13:39:45,298 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-01-28 13:39:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:39:45,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-28 13:39:45,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:39:45,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:39:45,699 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:39:45,699 INFO L388 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-01-28 13:39:46,915 INFO L388 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-01-28 13:39:47,081 INFO L388 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 25 treesize of output 7 [2022-01-28 13:39:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:47,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:39:47,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:39:47,929 INFO L388 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 111 treesize of output 95 [2022-01-28 13:39:47,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:39:49,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:39:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:39:49,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728547902] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:39:49,719 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:39:49,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 92 [2022-01-28 13:39:49,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972406554] [2022-01-28 13:39:49,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:39:49,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-01-28 13:39:49,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:39:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-01-28 13:39:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=7855, Unknown=6, NotChecked=0, Total=8372 [2022-01-28 13:39:49,721 INFO L87 Difference]: Start difference. First operand 2501 states and 6388 transitions. Second operand has 92 states, 92 states have (on average 3.652173913043478) internal successors, (336), 92 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:01,018 INFO L93 Difference]: Finished difference Result 5204 states and 13492 transitions. [2022-01-28 13:40:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-01-28 13:40:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 3.652173913043478) internal successors, (336), 92 states have internal predecessors, (336), 0 states have call successors, (0), 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 130 [2022-01-28 13:40:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:01,026 INFO L225 Difference]: With dead ends: 5204 [2022-01-28 13:40:01,026 INFO L226 Difference]: Without dead ends: 4989 [2022-01-28 13:40:01,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 210 SyntacticMatches, 17 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13694 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2839, Invalid=34952, Unknown=39, NotChecked=0, Total=37830 [2022-01-28 13:40:01,029 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 3103 mSDsluCounter, 9091 mSDsCounter, 0 mSdLazyCounter, 4847 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 8674 SdHoareTripleChecker+Invalid, 7284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2108 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:01,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3103 Valid, 8674 Invalid, 7284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4847 Invalid, 0 Unknown, 2108 Unchecked, 1.9s Time] [2022-01-28 13:40:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2022-01-28 13:40:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 2470. [2022-01-28 13:40:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 2.5686512758201703) internal successors, (6342), 2469 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 6342 transitions. [2022-01-28 13:40:01,074 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 6342 transitions. Word has length 130 [2022-01-28 13:40:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:01,074 INFO L470 AbstractCegarLoop]: Abstraction has 2470 states and 6342 transitions. [2022-01-28 13:40:01,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 3.652173913043478) internal successors, (336), 92 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 6342 transitions. [2022-01-28 13:40:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:40:01,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:01,078 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:40:01,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-28 13:40:01,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:01,292 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1742848283, now seen corresponding path program 20 times [2022-01-28 13:40:01,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764683304] [2022-01-28 13:40:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:01,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:02,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764683304] [2022-01-28 13:40:02,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764683304] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408505549] [2022-01-28 13:40:02,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:40:02,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:02,486 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-01-28 13:40:02,486 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-01-28 13:40:02,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:40:02,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:02,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-28 13:40:02,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:02,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:40:02,765 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:40:02,765 INFO L388 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-01-28 13:40:03,821 INFO L388 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-01-28 13:40:03,948 INFO L388 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 25 treesize of output 7 [2022-01-28 13:40:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:04,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:04,950 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:04,950 INFO L388 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 111 treesize of output 95 [2022-01-28 13:40:04,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:40:06,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:40:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:06,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408505549] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:06,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:06,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 91 [2022-01-28 13:40:06,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246515636] [2022-01-28 13:40:06,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:06,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-28 13:40:06,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-28 13:40:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=7629, Unknown=4, NotChecked=0, Total=8190 [2022-01-28 13:40:06,561 INFO L87 Difference]: Start difference. First operand 2470 states and 6342 transitions. Second operand has 91 states, 91 states have (on average 3.5824175824175826) internal successors, (326), 91 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:13,822 INFO L93 Difference]: Finished difference Result 4490 states and 11582 transitions. [2022-01-28 13:40:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-01-28 13:40:13,822 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.5824175824175826) internal successors, (326), 91 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-01-28 13:40:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:13,829 INFO L225 Difference]: With dead ends: 4490 [2022-01-28 13:40:13,829 INFO L226 Difference]: Without dead ends: 4233 [2022-01-28 13:40:13,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 207 SyntacticMatches, 14 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11763 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2440, Invalid=30097, Unknown=43, NotChecked=0, Total=32580 [2022-01-28 13:40:13,831 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 2983 mSDsluCounter, 9075 mSDsCounter, 0 mSdLazyCounter, 4789 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2983 SdHoareTripleChecker+Valid, 8668 SdHoareTripleChecker+Invalid, 7068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 4789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2005 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:13,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2983 Valid, 8668 Invalid, 7068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 4789 Invalid, 0 Unknown, 2005 Unchecked, 1.5s Time] [2022-01-28 13:40:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2022-01-28 13:40:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2511. [2022-01-28 13:40:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 2.5780876494023905) internal successors, (6471), 2510 states have internal predecessors, (6471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 6471 transitions. [2022-01-28 13:40:13,871 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 6471 transitions. Word has length 130 [2022-01-28 13:40:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:13,871 INFO L470 AbstractCegarLoop]: Abstraction has 2511 states and 6471 transitions. [2022-01-28 13:40:13,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.5824175824175826) internal successors, (326), 91 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 6471 transitions. [2022-01-28 13:40:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:40:13,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:13,875 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:40:13,892 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-01-28 13:40:14,092 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,SelfDestructingSolverStorable27 [2022-01-28 13:40:14,092 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1104067229, now seen corresponding path program 21 times [2022-01-28 13:40:14,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:14,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238085328] [2022-01-28 13:40:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:14,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:15,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:15,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238085328] [2022-01-28 13:40:15,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238085328] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:15,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33289243] [2022-01-28 13:40:15,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:40:15,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:15,526 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-01-28 13:40:15,527 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-01-28 13:40:15,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-28 13:40:15,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:15,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-28 13:40:15,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:15,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:40:15,812 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:40:15,813 INFO L388 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-01-28 13:40:16,175 INFO L388 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-01-28 13:40:16,280 INFO L388 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 7 [2022-01-28 13:40:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:40:16,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:17,041 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:17,041 INFO L388 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 111 treesize of output 95 [2022-01-28 13:40:17,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:40:17,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:40:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:40:17,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33289243] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:17,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:17,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 23, 23] total 63 [2022-01-28 13:40:17,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520453129] [2022-01-28 13:40:17,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:17,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-28 13:40:17,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-28 13:40:17,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3675, Unknown=2, NotChecked=0, Total=3906 [2022-01-28 13:40:17,922 INFO L87 Difference]: Start difference. First operand 2511 states and 6471 transitions. Second operand has 63 states, 63 states have (on average 4.222222222222222) internal successors, (266), 63 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-01-28 13:40:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:21,299 INFO L93 Difference]: Finished difference Result 3487 states and 9063 transitions. [2022-01-28 13:40:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-28 13:40:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.222222222222222) internal successors, (266), 63 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 130 [2022-01-28 13:40:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:21,304 INFO L225 Difference]: With dead ends: 3487 [2022-01-28 13:40:21,304 INFO L226 Difference]: Without dead ends: 3330 [2022-01-28 13:40:21,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 232 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=893, Invalid=11095, Unknown=2, NotChecked=0, Total=11990 [2022-01-28 13:40:21,306 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 1213 mSDsluCounter, 6430 mSDsCounter, 0 mSdLazyCounter, 3308 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 6101 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:21,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1213 Valid, 6101 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3308 Invalid, 0 Unknown, 310 Unchecked, 1.1s Time] [2022-01-28 13:40:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2022-01-28 13:40:21,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2461. [2022-01-28 13:40:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2460 states have (on average 2.571951219512195) internal successors, (6327), 2460 states have internal predecessors, (6327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 6327 transitions. [2022-01-28 13:40:21,341 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 6327 transitions. Word has length 130 [2022-01-28 13:40:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:21,341 INFO L470 AbstractCegarLoop]: Abstraction has 2461 states and 6327 transitions. [2022-01-28 13:40:21,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.222222222222222) internal successors, (266), 63 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-01-28 13:40:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 6327 transitions. [2022-01-28 13:40:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:40:21,345 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:21,345 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:40:21,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-01-28 13:40:21,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-28 13:40:21,561 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:21,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1241086741, now seen corresponding path program 22 times [2022-01-28 13:40:21,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:21,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073195260] [2022-01-28 13:40:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:21,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:22,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073195260] [2022-01-28 13:40:22,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073195260] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683602108] [2022-01-28 13:40:22,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:40:22,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:22,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:22,618 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-01-28 13:40:22,619 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-01-28 13:40:22,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:40:22,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:22,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-28 13:40:22,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:22,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:40:22,865 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:40:22,866 INFO L388 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-01-28 13:40:23,624 INFO L388 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 19 treesize of output 21 [2022-01-28 13:40:23,723 INFO L354 Elim1Store]: treesize reduction 15, result has 16.7 percent of original size [2022-01-28 13:40:23,723 INFO L388 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 10 [2022-01-28 13:40:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:23,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:24,268 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_827 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_827) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4)))) c_~N~0)) (forall ((v_ArrVal_827 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_827) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:40:24,309 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:24,309 INFO L388 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 82 treesize of output 74 [2022-01-28 13:40:24,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:40:24,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:40:25,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:40:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:25,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683602108] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:25,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:25,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 33] total 86 [2022-01-28 13:40:25,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592548473] [2022-01-28 13:40:25,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:25,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-01-28 13:40:25,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:25,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-01-28 13:40:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=6595, Unknown=1, NotChecked=166, Total=7310 [2022-01-28 13:40:25,800 INFO L87 Difference]: Start difference. First operand 2461 states and 6327 transitions. Second operand has 86 states, 86 states have (on average 3.5813953488372094) internal successors, (308), 86 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:31,334 INFO L93 Difference]: Finished difference Result 3647 states and 9389 transitions. [2022-01-28 13:40:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-28 13:40:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.5813953488372094) internal successors, (308), 86 states have internal predecessors, (308), 0 states have call successors, (0), 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 130 [2022-01-28 13:40:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:31,339 INFO L225 Difference]: With dead ends: 3647 [2022-01-28 13:40:31,339 INFO L226 Difference]: Without dead ends: 3357 [2022-01-28 13:40:31,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 205 SyntacticMatches, 9 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6855 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2081, Invalid=19974, Unknown=1, NotChecked=294, Total=22350 [2022-01-28 13:40:31,342 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 1635 mSDsluCounter, 6071 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 5806 SdHoareTripleChecker+Invalid, 3830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:31,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1635 Valid, 5806 Invalid, 3830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3078 Invalid, 0 Unknown, 631 Unchecked, 1.2s Time] [2022-01-28 13:40:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2022-01-28 13:40:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 2433. [2022-01-28 13:40:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 2.5682565789473686) internal successors, (6246), 2432 states have internal predecessors, (6246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 6246 transitions. [2022-01-28 13:40:31,373 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 6246 transitions. Word has length 130 [2022-01-28 13:40:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:31,373 INFO L470 AbstractCegarLoop]: Abstraction has 2433 states and 6246 transitions. [2022-01-28 13:40:31,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.5813953488372094) internal successors, (308), 86 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 6246 transitions. [2022-01-28 13:40:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-28 13:40:31,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:31,395 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:40:31,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-01-28 13:40:31,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:31,596 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 581379875, now seen corresponding path program 23 times [2022-01-28 13:40:31,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:31,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222720222] [2022-01-28 13:40:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:31,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:32,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:32,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222720222] [2022-01-28 13:40:32,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222720222] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:32,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454894961] [2022-01-28 13:40:32,669 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:40:32,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:32,672 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-01-28 13:40:32,673 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-01-28 13:40:32,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:40:32,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:32,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-28 13:40:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:33,369 INFO L388 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 7 [2022-01-28 13:40:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:40:33,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:34,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:34,033 INFO L388 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 51 treesize of output 35 [2022-01-28 13:40:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:40:34,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454894961] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:34,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:34,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 21, 16] total 58 [2022-01-28 13:40:34,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667956827] [2022-01-28 13:40:34,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:34,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-28 13:40:34,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:34,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-28 13:40:34,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3080, Unknown=0, NotChecked=0, Total=3306 [2022-01-28 13:40:34,447 INFO L87 Difference]: Start difference. First operand 2433 states and 6246 transitions. Second operand has 58 states, 58 states have (on average 4.4655172413793105) internal successors, (259), 58 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:37,375 INFO L93 Difference]: Finished difference Result 3809 states and 9806 transitions. [2022-01-28 13:40:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-28 13:40:37,376 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.4655172413793105) internal successors, (259), 58 states have internal predecessors, (259), 0 states have call successors, (0), 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 130 [2022-01-28 13:40:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:37,382 INFO L225 Difference]: With dead ends: 3809 [2022-01-28 13:40:37,382 INFO L226 Difference]: Without dead ends: 3725 [2022-01-28 13:40:37,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3387 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=962, Invalid=11028, Unknown=0, NotChecked=0, Total=11990 [2022-01-28 13:40:37,384 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1229 mSDsluCounter, 5274 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:37,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1229 Valid, 5074 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-28 13:40:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2022-01-28 13:40:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 2410. [2022-01-28 13:40:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 2409 states have (on average 2.5699460356994606) internal successors, (6191), 2409 states have internal predecessors, (6191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 6191 transitions. [2022-01-28 13:40:37,418 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 6191 transitions. Word has length 130 [2022-01-28 13:40:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:37,418 INFO L470 AbstractCegarLoop]: Abstraction has 2410 states and 6191 transitions. [2022-01-28 13:40:37,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.4655172413793105) internal successors, (259), 58 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 6191 transitions. [2022-01-28 13:40:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-28 13:40:37,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:37,422 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-28 13:40:37,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-01-28 13:40:37,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:37,635 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash -491141122, now seen corresponding path program 24 times [2022-01-28 13:40:37,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:37,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092972584] [2022-01-28 13:40:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:37,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:38,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092972584] [2022-01-28 13:40:38,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092972584] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400999056] [2022-01-28 13:40:38,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:40:38,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:38,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:38,803 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-01-28 13:40:38,804 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-01-28 13:40:38,910 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-28 13:40:38,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:38,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-28 13:40:38,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:39,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:40:39,474 INFO L388 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-01-28 13:40:39,630 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-28 13:40:39,630 INFO L388 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 10 [2022-01-28 13:40:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:40:39,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:40,049 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:40,049 INFO L388 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 45 treesize of output 45 [2022-01-28 13:40:40,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-01-28 13:40:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:40:40,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400999056] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:40,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:40,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14, 14] total 52 [2022-01-28 13:40:40,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347027618] [2022-01-28 13:40:40,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:40,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-28 13:40:40,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-28 13:40:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2457, Unknown=3, NotChecked=0, Total=2652 [2022-01-28 13:40:40,947 INFO L87 Difference]: Start difference. First operand 2410 states and 6191 transitions. Second operand has 52 states, 52 states have (on average 5.769230769230769) internal successors, (300), 52 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:44,859 INFO L93 Difference]: Finished difference Result 3823 states and 10141 transitions. [2022-01-28 13:40:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-28 13:40:44,860 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.769230769230769) internal successors, (300), 52 states have internal predecessors, (300), 0 states have call successors, (0), 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 135 [2022-01-28 13:40:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:44,866 INFO L225 Difference]: With dead ends: 3823 [2022-01-28 13:40:44,866 INFO L226 Difference]: Without dead ends: 3751 [2022-01-28 13:40:44,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1246, Invalid=7681, Unknown=3, NotChecked=0, Total=8930 [2022-01-28 13:40:44,867 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 1769 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:44,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 4511 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 996 Invalid, 0 Unknown, 288 Unchecked, 0.5s Time] [2022-01-28 13:40:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-01-28 13:40:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3164. [2022-01-28 13:40:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3163 states have (on average 2.6367372747391715) internal successors, (8340), 3163 states have internal predecessors, (8340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 8340 transitions. [2022-01-28 13:40:44,915 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 8340 transitions. Word has length 135 [2022-01-28 13:40:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:44,915 INFO L470 AbstractCegarLoop]: Abstraction has 3164 states and 8340 transitions. [2022-01-28 13:40:44,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.769230769230769) internal successors, (300), 52 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 8340 transitions. [2022-01-28 13:40:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-28 13:40:44,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:44,920 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-28 13:40:44,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-28 13:40:45,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:45,121 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1444166304, now seen corresponding path program 25 times [2022-01-28 13:40:45,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900534629] [2022-01-28 13:40:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:45,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:45,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:45,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900534629] [2022-01-28 13:40:45,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900534629] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:45,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980408544] [2022-01-28 13:40:45,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:40:45,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:45,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:45,616 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-01-28 13:40:45,618 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-01-28 13:40:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:45,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-28 13:40:45,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:45,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:40:45,845 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:40:45,845 INFO L388 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-01-28 13:40:46,484 INFO L388 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-01-28 13:40:46,647 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:46,647 INFO L388 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-01-28 13:40:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:46,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:46,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:46,910 INFO L388 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 47 treesize of output 47 [2022-01-28 13:40:46,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-28 13:40:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:48,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980408544] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:48,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:48,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 66 [2022-01-28 13:40:48,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058692093] [2022-01-28 13:40:48,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:48,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-28 13:40:48,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-28 13:40:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3860, Unknown=8, NotChecked=0, Total=4290 [2022-01-28 13:40:48,700 INFO L87 Difference]: Start difference. First operand 3164 states and 8340 transitions. Second operand has 66 states, 66 states have (on average 4.712121212121212) internal successors, (311), 66 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:40:55,322 INFO L93 Difference]: Finished difference Result 13311 states and 37679 transitions. [2022-01-28 13:40:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-28 13:40:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 4.712121212121212) internal successors, (311), 66 states have internal predecessors, (311), 0 states have call successors, (0), 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 135 [2022-01-28 13:40:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:40:55,345 INFO L225 Difference]: With dead ends: 13311 [2022-01-28 13:40:55,346 INFO L226 Difference]: Without dead ends: 13299 [2022-01-28 13:40:55,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 236 SyntacticMatches, 28 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6594 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2594, Invalid=17137, Unknown=9, NotChecked=0, Total=19740 [2022-01-28 13:40:55,347 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 1524 mSDsluCounter, 7239 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:40:55,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 7279 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2037 Invalid, 0 Unknown, 831 Unchecked, 0.8s Time] [2022-01-28 13:40:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13299 states. [2022-01-28 13:40:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13299 to 7470. [2022-01-28 13:40:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7470 states, 7469 states have (on average 2.8492435399651894) internal successors, (21281), 7469 states have internal predecessors, (21281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 21281 transitions. [2022-01-28 13:40:55,512 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 21281 transitions. Word has length 135 [2022-01-28 13:40:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:40:55,512 INFO L470 AbstractCegarLoop]: Abstraction has 7470 states and 21281 transitions. [2022-01-28 13:40:55,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.712121212121212) internal successors, (311), 66 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:40:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 21281 transitions. [2022-01-28 13:40:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-28 13:40:55,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:40:55,524 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-28 13:40:55,543 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-01-28 13:40:55,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:55,741 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:40:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:40:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 442989216, now seen corresponding path program 26 times [2022-01-28 13:40:55,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:40:55,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627367446] [2022-01-28 13:40:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:40:55,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:40:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:40:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:56,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:40:56,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627367446] [2022-01-28 13:40:56,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627367446] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:40:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90488958] [2022-01-28 13:40:56,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:40:56,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:40:56,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:40:56,436 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-01-28 13:40:56,437 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-01-28 13:40:56,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:40:56,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:40:56,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-28 13:40:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:40:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:40:57,781 INFO L388 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 19 treesize of output 21 [2022-01-28 13:40:58,083 INFO L388 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-01-28 13:40:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:58,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:40:58,411 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:40:58,411 INFO L388 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 47 treesize of output 47 [2022-01-28 13:40:58,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-28 13:40:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:40:59,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90488958] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:40:59,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:40:59,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2022-01-28 13:40:59,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859494979] [2022-01-28 13:40:59,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:40:59,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-28 13:40:59,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:40:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-28 13:40:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=4347, Unknown=13, NotChecked=0, Total=4830 [2022-01-28 13:40:59,759 INFO L87 Difference]: Start difference. First operand 7470 states and 21281 transitions. Second operand has 70 states, 70 states have (on average 4.9) internal successors, (343), 70 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-01-28 13:41:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:05,661 INFO L93 Difference]: Finished difference Result 12548 states and 33087 transitions. [2022-01-28 13:41:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-01-28 13:41:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.9) internal successors, (343), 70 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 135 [2022-01-28 13:41:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:05,678 INFO L225 Difference]: With dead ends: 12548 [2022-01-28 13:41:05,678 INFO L226 Difference]: Without dead ends: 9232 [2022-01-28 13:41:05,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6767 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2978, Invalid=19060, Unknown=14, NotChecked=0, Total=22052 [2022-01-28 13:41:05,680 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 4853 mSDsluCounter, 8708 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4853 SdHoareTripleChecker+Valid, 8346 SdHoareTripleChecker+Invalid, 4583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:05,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4853 Valid, 8346 Invalid, 4583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3675 Invalid, 0 Unknown, 406 Unchecked, 1.5s Time] [2022-01-28 13:41:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2022-01-28 13:41:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 4260. [2022-01-28 13:41:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4260 states, 4259 states have (on average 2.736557877436018) internal successors, (11655), 4259 states have internal predecessors, (11655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 11655 transitions. [2022-01-28 13:41:05,804 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 11655 transitions. Word has length 135 [2022-01-28 13:41:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:05,804 INFO L470 AbstractCegarLoop]: Abstraction has 4260 states and 11655 transitions. [2022-01-28 13:41:05,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.9) internal successors, (343), 70 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-01-28 13:41:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 11655 transitions. [2022-01-28 13:41:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-28 13:41:05,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:05,810 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-28 13:41:05,829 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-01-28 13:41:06,023 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,SelfDestructingSolverStorable33 [2022-01-28 13:41:06,023 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1470786520, now seen corresponding path program 27 times [2022-01-28 13:41:06,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:06,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138623426] [2022-01-28 13:41:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:06,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:07,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:07,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138623426] [2022-01-28 13:41:07,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138623426] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:07,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156757264] [2022-01-28 13:41:07,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:41:07,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:07,015 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-01-28 13:41:07,016 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-01-28 13:41:07,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:41:07,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:41:07,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-28 13:41:07,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:07,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:41:07,697 INFO L388 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 19 treesize of output 21 [2022-01-28 13:41:07,778 INFO L388 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 7 [2022-01-28 13:41:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:41:07,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:07,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_992) c_~q~0.base) (+ c_~q~0.offset 4 (* c_~q_front~0 4))) 0))) is different from false [2022-01-28 13:41:07,939 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:07,939 INFO L388 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 47 treesize of output 47 [2022-01-28 13:41:07,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-01-28 13:41:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 5 not checked. [2022-01-28 13:41:08,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156757264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:08,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:08,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14, 14] total 52 [2022-01-28 13:41:08,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8898028] [2022-01-28 13:41:08,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:08,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-28 13:41:08,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-28 13:41:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2401, Unknown=1, NotChecked=98, Total=2652 [2022-01-28 13:41:08,491 INFO L87 Difference]: Start difference. First operand 4260 states and 11655 transitions. Second operand has 52 states, 52 states have (on average 6.076923076923077) internal successors, (316), 52 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-01-28 13:41:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:12,112 INFO L93 Difference]: Finished difference Result 5998 states and 15812 transitions. [2022-01-28 13:41:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-28 13:41:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 6.076923076923077) internal successors, (316), 52 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 135 [2022-01-28 13:41:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:12,121 INFO L225 Difference]: With dead ends: 5998 [2022-01-28 13:41:12,122 INFO L226 Difference]: Without dead ends: 5998 [2022-01-28 13:41:12,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=919, Invalid=7094, Unknown=1, NotChecked=176, Total=8190 [2022-01-28 13:41:12,126 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 2061 mSDsluCounter, 3945 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:12,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 3833 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1846 Invalid, 0 Unknown, 291 Unchecked, 0.8s Time] [2022-01-28 13:41:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2022-01-28 13:41:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3179. [2022-01-28 13:41:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3178 states have (on average 2.6211453744493394) internal successors, (8330), 3178 states have internal predecessors, (8330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 8330 transitions. [2022-01-28 13:41:12,186 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 8330 transitions. Word has length 135 [2022-01-28 13:41:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:12,187 INFO L470 AbstractCegarLoop]: Abstraction has 3179 states and 8330 transitions. [2022-01-28 13:41:12,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.076923076923077) internal successors, (316), 52 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-01-28 13:41:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 8330 transitions. [2022-01-28 13:41:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:41:12,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:12,191 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-01-28 13:41:12,210 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-01-28 13:41:12,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:12,409 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1665649740, now seen corresponding path program 28 times [2022-01-28 13:41:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:12,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940232423] [2022-01-28 13:41:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:12,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:13,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940232423] [2022-01-28 13:41:13,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940232423] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:13,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640041881] [2022-01-28 13:41:13,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:41:13,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:13,923 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-01-28 13:41:13,924 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-01-28 13:41:14,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:41:14,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:41:14,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-28 13:41:14,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:14,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:41:14,267 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:41:14,268 INFO L388 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-01-28 13:41:14,994 INFO L388 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-01-28 13:41:15,070 INFO L388 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 7 [2022-01-28 13:41:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:15,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:15,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1030) c_~q~0.base) (+ c_~q~0.offset (* c_~q_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ .cse0 c_~s~0))) (and (<= .cse1 c_~N~0) (<= c_~N~0 .cse1)))))) is different from false [2022-01-28 13:41:15,824 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:15,824 INFO L388 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 111 treesize of output 95 [2022-01-28 13:41:15,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:41:16,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:41:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:16,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640041881] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:16,441 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:16,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 23, 23] total 69 [2022-01-28 13:41:16,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563567509] [2022-01-28 13:41:16,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:16,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-01-28 13:41:16,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:16,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-01-28 13:41:16,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4305, Unknown=1, NotChecked=132, Total=4692 [2022-01-28 13:41:16,443 INFO L87 Difference]: Start difference. First operand 3179 states and 8330 transitions. Second operand has 69 states, 69 states have (on average 4.188405797101449) internal successors, (289), 69 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:20,999 INFO L93 Difference]: Finished difference Result 5061 states and 13209 transitions. [2022-01-28 13:41:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-28 13:41:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 4.188405797101449) internal successors, (289), 69 states have internal predecessors, (289), 0 states have call successors, (0), 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 137 [2022-01-28 13:41:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:21,006 INFO L225 Difference]: With dead ends: 5061 [2022-01-28 13:41:21,006 INFO L226 Difference]: Without dead ends: 4641 [2022-01-28 13:41:21,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 251 SyntacticMatches, 7 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1614, Invalid=14645, Unknown=1, NotChecked=252, Total=16512 [2022-01-28 13:41:21,008 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 2456 mSDsluCounter, 6686 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2456 SdHoareTripleChecker+Valid, 6206 SdHoareTripleChecker+Invalid, 4243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 799 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:21,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2456 Valid, 6206 Invalid, 4243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3330 Invalid, 0 Unknown, 799 Unchecked, 1.2s Time] [2022-01-28 13:41:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2022-01-28 13:41:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 3184. [2022-01-28 13:41:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 2.6145146088595665) internal successors, (8322), 3183 states have internal predecessors, (8322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 8322 transitions. [2022-01-28 13:41:21,058 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 8322 transitions. Word has length 137 [2022-01-28 13:41:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:21,058 INFO L470 AbstractCegarLoop]: Abstraction has 3184 states and 8322 transitions. [2022-01-28 13:41:21,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 4.188405797101449) internal successors, (289), 69 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 8322 transitions. [2022-01-28 13:41:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:41:21,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:21,063 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-01-28 13:41:21,081 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-01-28 13:41:21,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:21,279 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1407207440, now seen corresponding path program 29 times [2022-01-28 13:41:21,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:21,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577223992] [2022-01-28 13:41:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:21,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:22,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:22,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577223992] [2022-01-28 13:41:22,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577223992] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:22,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837236366] [2022-01-28 13:41:22,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:41:22,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:22,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:22,965 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-01-28 13:41:22,966 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-01-28 13:41:23,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-28 13:41:23,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:41:23,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-28 13:41:23,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:24,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:41:24,110 INFO L388 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-01-28 13:41:24,207 INFO L388 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 7 [2022-01-28 13:41:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-28 13:41:24,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:24,860 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:24,861 INFO L388 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 82 treesize of output 74 [2022-01-28 13:41:24,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:41:24,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:41:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:25,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837236366] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:25,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:25,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 22] total 72 [2022-01-28 13:41:25,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556984040] [2022-01-28 13:41:25,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:25,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-28 13:41:25,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-28 13:41:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4815, Unknown=6, NotChecked=0, Total=5112 [2022-01-28 13:41:25,944 INFO L87 Difference]: Start difference. First operand 3184 states and 8322 transitions. Second operand has 72 states, 72 states have (on average 4.388888888888889) internal successors, (316), 72 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-01-28 13:41:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:30,960 INFO L93 Difference]: Finished difference Result 5500 states and 14498 transitions. [2022-01-28 13:41:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-28 13:41:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.388888888888889) internal successors, (316), 72 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 137 [2022-01-28 13:41:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:30,968 INFO L225 Difference]: With dead ends: 5500 [2022-01-28 13:41:30,968 INFO L226 Difference]: Without dead ends: 5361 [2022-01-28 13:41:30,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 240 SyntacticMatches, 6 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5791 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1767, Invalid=18531, Unknown=8, NotChecked=0, Total=20306 [2022-01-28 13:41:30,970 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 2351 mSDsluCounter, 5720 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:30,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2351 Valid, 5398 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 3163 Invalid, 0 Unknown, 264 Unchecked, 1.1s Time] [2022-01-28 13:41:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2022-01-28 13:41:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 3068. [2022-01-28 13:41:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3067 states have (on average 2.6168894685360287) internal successors, (8026), 3067 states have internal predecessors, (8026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 8026 transitions. [2022-01-28 13:41:31,030 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 8026 transitions. Word has length 137 [2022-01-28 13:41:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:31,030 INFO L470 AbstractCegarLoop]: Abstraction has 3068 states and 8026 transitions. [2022-01-28 13:41:31,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.388888888888889) internal successors, (316), 72 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-01-28 13:41:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 8026 transitions. [2022-01-28 13:41:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:41:31,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:31,034 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-01-28 13:41:31,052 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-01-28 13:41:31,250 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,SelfDestructingSolverStorable36 [2022-01-28 13:41:31,251 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1936274012, now seen corresponding path program 30 times [2022-01-28 13:41:31,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:31,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633882419] [2022-01-28 13:41:31,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:31,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:32,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633882419] [2022-01-28 13:41:32,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633882419] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:32,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444245379] [2022-01-28 13:41:32,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:41:32,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:32,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:32,521 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-01-28 13:41:32,522 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-01-28 13:41:32,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-28 13:41:32,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:41:32,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-28 13:41:32,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:33,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:41:33,414 INFO L388 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-01-28 13:41:33,487 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-01-28 13:41:33,487 INFO L388 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 10 [2022-01-28 13:41:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:33,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:34,077 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:34,078 INFO L388 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 82 treesize of output 74 [2022-01-28 13:41:34,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2022-01-28 13:41:34,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-28 13:41:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:34,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444245379] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:34,920 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:34,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 22, 22] total 68 [2022-01-28 13:41:34,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687151930] [2022-01-28 13:41:34,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:34,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-28 13:41:34,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-28 13:41:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4286, Unknown=4, NotChecked=0, Total=4556 [2022-01-28 13:41:34,921 INFO L87 Difference]: Start difference. First operand 3068 states and 8026 transitions. Second operand has 68 states, 68 states have (on average 4.455882352941177) internal successors, (303), 68 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:38,341 INFO L93 Difference]: Finished difference Result 5252 states and 13798 transitions. [2022-01-28 13:41:38,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-28 13:41:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.455882352941177) internal successors, (303), 68 states have internal predecessors, (303), 0 states have call successors, (0), 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 137 [2022-01-28 13:41:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:38,350 INFO L225 Difference]: With dead ends: 5252 [2022-01-28 13:41:38,350 INFO L226 Difference]: Without dead ends: 5049 [2022-01-28 13:41:38,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 246 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4364 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1425, Invalid=14826, Unknown=5, NotChecked=0, Total=16256 [2022-01-28 13:41:38,352 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 1839 mSDsluCounter, 5887 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 2648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:38,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1839 Valid, 5679 Invalid, 2648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2130 Invalid, 0 Unknown, 452 Unchecked, 0.7s Time] [2022-01-28 13:41:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5049 states. [2022-01-28 13:41:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5049 to 3113. [2022-01-28 13:41:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 3112 states have (on average 2.6166452442159382) internal successors, (8143), 3112 states have internal predecessors, (8143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 8143 transitions. [2022-01-28 13:41:38,440 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 8143 transitions. Word has length 137 [2022-01-28 13:41:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:38,440 INFO L470 AbstractCegarLoop]: Abstraction has 3113 states and 8143 transitions. [2022-01-28 13:41:38,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.455882352941177) internal successors, (303), 68 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 8143 transitions. [2022-01-28 13:41:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:41:38,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:38,444 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-01-28 13:41:38,460 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-01-28 13:41:38,659 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,SelfDestructingSolverStorable37 [2022-01-28 13:41:38,660 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2053964588, now seen corresponding path program 31 times [2022-01-28 13:41:38,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:38,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323767047] [2022-01-28 13:41:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:38,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:40,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:40,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323767047] [2022-01-28 13:41:40,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323767047] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:40,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822550951] [2022-01-28 13:41:40,271 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:41:40,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:40,272 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-01-28 13:41:40,274 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-01-28 13:41:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:40,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-28 13:41:40,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:40,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:41:40,745 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:41:40,746 INFO L388 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-01-28 13:41:41,998 INFO L388 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 19 treesize of output 21 [2022-01-28 13:41:42,172 INFO L388 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 25 treesize of output 7 [2022-01-28 13:41:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:42,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:43,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:43,348 INFO L388 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 111 treesize of output 95 [2022-01-28 13:41:43,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:41:45,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:41:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:45,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822550951] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:45,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:45,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 37] total 99 [2022-01-28 13:41:45,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624390988] [2022-01-28 13:41:45,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:45,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-01-28 13:41:45,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-01-28 13:41:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=9038, Unknown=4, NotChecked=0, Total=9702 [2022-01-28 13:41:45,197 INFO L87 Difference]: Start difference. First operand 3113 states and 8143 transitions. Second operand has 99 states, 99 states have (on average 3.606060606060606) internal successors, (357), 99 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:41:52,277 INFO L93 Difference]: Finished difference Result 5751 states and 15103 transitions. [2022-01-28 13:41:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-01-28 13:41:52,277 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 3.606060606060606) internal successors, (357), 99 states have internal predecessors, (357), 0 states have call successors, (0), 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 137 [2022-01-28 13:41:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:41:52,308 INFO L225 Difference]: With dead ends: 5751 [2022-01-28 13:41:52,308 INFO L226 Difference]: Without dead ends: 5557 [2022-01-28 13:41:52,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10410 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3256, Invalid=31879, Unknown=21, NotChecked=0, Total=35156 [2022-01-28 13:41:52,310 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 2596 mSDsluCounter, 7372 mSDsCounter, 0 mSdLazyCounter, 4089 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 6996 SdHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 4089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:41:52,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2596 Valid, 6996 Invalid, 5288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 4089 Invalid, 0 Unknown, 1011 Unchecked, 1.4s Time] [2022-01-28 13:41:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2022-01-28 13:41:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3098. [2022-01-28 13:41:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 3097 states have (on average 2.616725863739102) internal successors, (8104), 3097 states have internal predecessors, (8104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 8104 transitions. [2022-01-28 13:41:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 8104 transitions. Word has length 137 [2022-01-28 13:41:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:41:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 3098 states and 8104 transitions. [2022-01-28 13:41:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 3.606060606060606) internal successors, (357), 99 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:41:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 8104 transitions. [2022-01-28 13:41:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-28 13:41:52,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:41:52,364 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2022-01-28 13:41:52,381 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-01-28 13:41:52,581 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,SelfDestructingSolverStorable38 [2022-01-28 13:41:52,581 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:41:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:41:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 200868294, now seen corresponding path program 32 times [2022-01-28 13:41:52,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:41:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113954880] [2022-01-28 13:41:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:41:52,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:41:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:41:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:41:53,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:41:53,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113954880] [2022-01-28 13:41:53,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113954880] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:41:53,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076958442] [2022-01-28 13:41:53,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:41:53,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:41:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:41:53,495 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-01-28 13:41:53,495 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-01-28 13:41:53,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:41:53,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:41:53,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-28 13:41:53,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:41:53,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:41:53,723 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:41:53,723 INFO L388 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-01-28 13:41:54,106 INFO L388 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-01-28 13:41:54,184 INFO L388 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 7 [2022-01-28 13:41:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-28 13:41:54,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:41:54,720 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:41:54,720 INFO L388 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 111 treesize of output 95 [2022-01-28 13:41:54,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2022-01-28 13:41:55,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:41:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-28 13:41:55,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076958442] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:41:55,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:41:55,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 25, 23] total 70 [2022-01-28 13:41:55,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810139238] [2022-01-28 13:41:55,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:41:55,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-01-28 13:41:55,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:41:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-01-28 13:41:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=4548, Unknown=3, NotChecked=0, Total=4830 [2022-01-28 13:41:55,447 INFO L87 Difference]: Start difference. First operand 3098 states and 8104 transitions. Second operand has 70 states, 70 states have (on average 4.242857142857143) internal successors, (297), 70 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:42:01,086 INFO L93 Difference]: Finished difference Result 5448 states and 14356 transitions. [2022-01-28 13:42:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-28 13:42:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.242857142857143) internal successors, (297), 70 states have internal predecessors, (297), 0 states have call successors, (0), 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 137 [2022-01-28 13:42:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:42:01,094 INFO L225 Difference]: With dead ends: 5448 [2022-01-28 13:42:01,094 INFO L226 Difference]: Without dead ends: 5238 [2022-01-28 13:42:01,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6106 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1885, Invalid=19573, Unknown=4, NotChecked=0, Total=21462 [2022-01-28 13:42:01,096 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 1913 mSDsluCounter, 5777 mSDsCounter, 0 mSdLazyCounter, 3221 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:42:01,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1913 Valid, 5450 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3221 Invalid, 0 Unknown, 339 Unchecked, 1.3s Time] [2022-01-28 13:42:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2022-01-28 13:42:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 3062. [2022-01-28 13:42:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3061 states have (on average 2.61515844495263) internal successors, (8005), 3061 states have internal predecessors, (8005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 8005 transitions. [2022-01-28 13:42:01,139 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 8005 transitions. Word has length 137 [2022-01-28 13:42:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:42:01,139 INFO L470 AbstractCegarLoop]: Abstraction has 3062 states and 8005 transitions. [2022-01-28 13:42:01,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.242857142857143) internal successors, (297), 70 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 8005 transitions. [2022-01-28 13:42:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:42:01,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:42:01,142 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:42:01,159 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-01-28 13:42:01,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-28 13:42:01,359 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:42:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:42:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1523455396, now seen corresponding path program 33 times [2022-01-28 13:42:01,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:42:01,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647190796] [2022-01-28 13:42:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:42:01,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:42:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:42:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:02,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:42:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647190796] [2022-01-28 13:42:02,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647190796] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:42:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151726953] [2022-01-28 13:42:02,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:42:02,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:42:02,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:42:02,849 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-01-28 13:42:02,850 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-01-28 13:42:03,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:42:03,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:42:03,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-28 13:42:03,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:42:04,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:42:04,234 INFO L388 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 30 treesize of output 30 [2022-01-28 13:42:04,486 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-01-28 13:42:04,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 19 [2022-01-28 13:42:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:42:04,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:42:04,895 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1213 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1213) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))) c_~N~0)) (forall ((v_ArrVal_1213 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1213) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) is different from false [2022-01-28 13:42:05,432 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:42:05,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:42:05,437 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:05,438 INFO L388 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 79 treesize of output 66 [2022-01-28 13:42:05,442 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:05,442 INFO L388 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 66 treesize of output 53 [2022-01-28 13:42:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:42:06,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151726953] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:42:06,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:42:06,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 27, 27] total 82 [2022-01-28 13:42:06,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78654960] [2022-01-28 13:42:06,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:42:06,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-28 13:42:06,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:42:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-28 13:42:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=6190, Unknown=5, NotChecked=158, Total=6642 [2022-01-28 13:42:06,515 INFO L87 Difference]: Start difference. First operand 3062 states and 8005 transitions. Second operand has 82 states, 82 states have (on average 3.9390243902439024) internal successors, (323), 82 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:42:11,529 INFO L93 Difference]: Finished difference Result 4362 states and 11374 transitions. [2022-01-28 13:42:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-01-28 13:42:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.9390243902439024) internal successors, (323), 82 states have internal predecessors, (323), 0 states have call successors, (0), 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 139 [2022-01-28 13:42:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:42:11,535 INFO L225 Difference]: With dead ends: 4362 [2022-01-28 13:42:11,535 INFO L226 Difference]: Without dead ends: 4014 [2022-01-28 13:42:11,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 248 SyntacticMatches, 6 SemanticMatches, 147 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 5867 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1255, Invalid=20500, Unknown=5, NotChecked=292, Total=22052 [2022-01-28 13:42:11,537 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 1859 mSDsluCounter, 10406 mSDsCounter, 0 mSdLazyCounter, 3700 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 9924 SdHoareTripleChecker+Invalid, 5520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1706 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:42:11,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1859 Valid, 9924 Invalid, 5520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3700 Invalid, 0 Unknown, 1706 Unchecked, 1.3s Time] [2022-01-28 13:42:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2022-01-28 13:42:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3215. [2022-01-28 13:42:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 3214 states have (on average 2.6222775357809582) internal successors, (8428), 3214 states have internal predecessors, (8428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 8428 transitions. [2022-01-28 13:42:11,582 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 8428 transitions. Word has length 139 [2022-01-28 13:42:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:42:11,582 INFO L470 AbstractCegarLoop]: Abstraction has 3215 states and 8428 transitions. [2022-01-28 13:42:11,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.9390243902439024) internal successors, (323), 82 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 8428 transitions. [2022-01-28 13:42:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:42:11,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:42:11,586 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:42:11,602 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-01-28 13:42:11,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:42:11,804 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:42:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:42:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash -286390406, now seen corresponding path program 34 times [2022-01-28 13:42:11,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:42:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277323505] [2022-01-28 13:42:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:42:11,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:42:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:42:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:13,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:42:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277323505] [2022-01-28 13:42:13,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277323505] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:42:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049827428] [2022-01-28 13:42:13,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:42:13,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:42:13,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:42:13,064 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-01-28 13:42:13,065 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-01-28 13:42:13,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:42:13,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:42:13,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-28 13:42:13,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:42:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:42:14,793 INFO L388 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 31 treesize of output 31 [2022-01-28 13:42:15,144 INFO L354 Elim1Store]: treesize reduction 99, result has 6.6 percent of original size [2022-01-28 13:42:15,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 19 [2022-01-28 13:42:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:15,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:42:15,665 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1246 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:42:15,695 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1246 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:42:15,711 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1246 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:42:15,721 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1246 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:42:15,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) (select .cse1 (+ c_~q~0.offset .cse2)) c_~s~0)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) (select .cse3 (+ c_~q~0.offset .cse4)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))))) is different from false [2022-01-28 13:42:15,863 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) (select .cse1 (+ c_~q~0.offset .cse2)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) (select .cse3 (+ c_~q~0.offset .cse4)) c_~s~0))))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0))) is different from false [2022-01-28 13:42:16,026 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:42:16,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:42:16,032 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:16,032 INFO L388 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 79 treesize of output 66 [2022-01-28 13:42:16,037 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:16,037 INFO L388 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 66 treesize of output 53 [2022-01-28 13:42:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-28 13:42:17,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049827428] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:42:17,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:42:17,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 104 [2022-01-28 13:42:17,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333042081] [2022-01-28 13:42:17,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:42:17,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-01-28 13:42:17,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:42:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-01-28 13:42:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=8598, Unknown=68, NotChecked=1182, Total=10712 [2022-01-28 13:42:17,538 INFO L87 Difference]: Start difference. First operand 3215 states and 8428 transitions. Second operand has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:26,851 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 c_~q_back~0))) (let ((.cse5 (+ .cse6 c_~q~0.offset)) (.cse13 (select |c_#memory_int| c_~q~0.base)) (.cse3 (+ c_~n~0 c_~q_front~0)) (.cse4 (* 4 c_~q_front~0))) (let ((.cse11 (<= (* 4 c_~n~0) (+ 7 .cse6 c_~q~0.offset))) (.cse0 (= (+ c_~q~0.offset .cse4) 0)) (.cse8 (<= .cse3 (+ 2 c_~q_back~0))) (.cse9 (= (select .cse13 (+ c_~q~0.offset (* c_~q_front~0 4))) 1)) (.cse1 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse7 (<= 1 c_~q_back~0)) (.cse10 (<= .cse5 4)) (.cse2 (= c_~s~0 0))) (and (or (and (or (not .cse0) (and .cse1 .cse2)) (<= .cse3 (+ 3 c_~q_back~0)) (< 0 (+ c_~q~0.offset .cse4 1))) (not (= 0 .cse5))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= 0 c_~s~0) (= .cse6 .cse4) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse7 (< c_~q_back~0 0)) (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and .cse0 .cse8 .cse9 .cse1 (= |c_thread1Thread1of1ForFork1_#t~post1#1| 0) .cse7 .cse2 .cse10) .cse11) (or .cse11 (and .cse0 .cse8 .cse9 .cse1 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork1_~i~0#1|) .cse7 .cse2 .cse10)) (let ((.cse12 (+ c_~q_back~0 1))) (or (< .cse12 0) (not (= (select .cse13 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse12) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) (select .cse14 (+ c_~q~0.offset .cse15)) c_~s~0)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) (select .cse16 (+ c_~q~0.offset .cse17)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))))) (or (<= c_~n~0 3) (<= .cse5 0)) (= c_~q~0.offset 0) .cse2)))) is different from false [2022-01-28 13:42:27,072 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 c_~q_back~0))) (let ((.cse5 (+ .cse6 c_~q~0.offset)) (.cse13 (select |c_#memory_int| c_~q~0.base)) (.cse3 (+ c_~n~0 c_~q_front~0)) (.cse4 (* 4 c_~q_front~0))) (let ((.cse11 (<= (* 4 c_~n~0) (+ 7 .cse6 c_~q~0.offset))) (.cse0 (= (+ c_~q~0.offset .cse4) 0)) (.cse8 (<= .cse3 (+ 2 c_~q_back~0))) (.cse9 (= (select .cse13 (+ c_~q~0.offset (* c_~q_front~0 4))) 1)) (.cse1 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse7 (<= 1 c_~q_back~0)) (.cse10 (<= .cse5 4)) (.cse2 (= c_~s~0 0))) (and (or (and (or (not .cse0) (and .cse1 .cse2)) (<= .cse3 (+ 3 c_~q_back~0)) (< 0 (+ c_~q~0.offset .cse4 1))) (not (= 0 .cse5))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= 0 c_~s~0) (= .cse6 .cse4) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse7 (< c_~q_back~0 0)) (or (and .cse0 .cse8 .cse9 .cse1 (= |c_thread1Thread1of1ForFork1_#t~post1#1| 0) .cse7 .cse2 .cse10) .cse11) (or .cse11 (and .cse0 .cse8 .cse9 .cse1 (<= |c_thread1Thread1of1ForFork1_~i~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork1_~i~0#1|) .cse7 .cse2 .cse10)) (let ((.cse12 (+ c_~q_back~0 1))) (or (< .cse12 0) (not (= (select .cse13 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse12) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) (select .cse14 (+ c_~q~0.offset .cse15)) c_~s~0)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) (select .cse16 (+ c_~q~0.offset .cse17)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))))) (or (<= c_~n~0 3) (<= .cse5 0)) (= c_~q~0.offset 0) .cse2)))) is different from false [2022-01-28 13:42:31,433 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) (select .cse1 (+ c_~q~0.offset .cse2)) c_~s~0)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) (select .cse3 (+ c_~q~0.offset .cse4)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))))) is different from false [2022-01-28 13:42:32,319 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_1246 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) (select .cse1 (+ c_~q~0.offset .cse2)) c_~s~0)))) (forall ((v_ArrVal_1246 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1246) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) (select .cse3 (+ c_~q~0.offset .cse4)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))))) is different from false [2022-01-28 13:42:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:42:34,538 INFO L93 Difference]: Finished difference Result 8695 states and 22360 transitions. [2022-01-28 13:42:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-01-28 13:42:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:42:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:42:34,551 INFO L225 Difference]: With dead ends: 8695 [2022-01-28 13:42:34,551 INFO L226 Difference]: Without dead ends: 8248 [2022-01-28 13:42:34,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 221 SyntacticMatches, 35 SemanticMatches, 252 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 22638 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=7123, Invalid=52033, Unknown=176, NotChecked=4930, Total=64262 [2022-01-28 13:42:34,578 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 4211 mSDsluCounter, 11577 mSDsCounter, 0 mSdLazyCounter, 6451 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4211 SdHoareTripleChecker+Valid, 10704 SdHoareTripleChecker+Invalid, 10953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 6451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3834 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:42:34,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4211 Valid, 10704 Invalid, 10953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 6451 Invalid, 0 Unknown, 3834 Unchecked, 2.6s Time] [2022-01-28 13:42:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2022-01-28 13:42:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 3478. [2022-01-28 13:42:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 2.6206499856197873) internal successors, (9112), 3477 states have internal predecessors, (9112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 9112 transitions. [2022-01-28 13:42:34,646 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 9112 transitions. Word has length 139 [2022-01-28 13:42:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:42:34,646 INFO L470 AbstractCegarLoop]: Abstraction has 3478 states and 9112 transitions. [2022-01-28 13:42:34,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 9112 transitions. [2022-01-28 13:42:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:42:34,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:42:34,651 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:42:34,668 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-01-28 13:42:34,860 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,SelfDestructingSolverStorable41 [2022-01-28 13:42:34,861 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:42:34,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:42:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -774168868, now seen corresponding path program 35 times [2022-01-28 13:42:34,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:42:34,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707475752] [2022-01-28 13:42:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:42:34,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:42:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:42:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:36,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:42:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707475752] [2022-01-28 13:42:36,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707475752] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:42:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550441971] [2022-01-28 13:42:36,399 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:42:36,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:42:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:42:36,400 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-01-28 13:42:36,403 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-01-28 13:42:36,519 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:42:36,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:42:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-28 13:42:36,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:42:36,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:42:36,832 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:42:36,832 INFO L388 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-01-28 13:42:38,610 INFO L388 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 29 treesize of output 29 [2022-01-28 13:42:39,298 INFO L354 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-01-28 13:42:39,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 19 [2022-01-28 13:42:39,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:39,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:42:39,775 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (and (forall ((v_ArrVal_1280 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1280 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:39,812 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~q_back~0 c_~q_front~0) (and (forall ((v_ArrVal_1280 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1280 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:39,832 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_1280 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1280 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:39,843 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (and (forall ((v_ArrVal_1280 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1280 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:42:40,271 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:42:40,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-01-28 13:42:40,278 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:40,279 INFO L388 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 79 treesize of output 66 [2022-01-28 13:42:40,285 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:40,285 INFO L388 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 66 treesize of output 53 [2022-01-28 13:42:43,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:42:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-28 13:42:43,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550441971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:42:43,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:42:43,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 38] total 108 [2022-01-28 13:42:43,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115342072] [2022-01-28 13:42:43,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:42:43,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:42:43,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:42:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:42:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=795, Invalid=9924, Unknown=9, NotChecked=828, Total=11556 [2022-01-28 13:42:43,599 INFO L87 Difference]: Start difference. First operand 3478 states and 9112 transitions. Second operand has 108 states, 108 states have (on average 3.3703703703703702) internal successors, (364), 108 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:42:47,859 INFO L93 Difference]: Finished difference Result 5018 states and 13042 transitions. [2022-01-28 13:42:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-28 13:42:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.3703703703703702) internal successors, (364), 108 states have internal predecessors, (364), 0 states have call successors, (0), 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 139 [2022-01-28 13:42:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:42:47,867 INFO L225 Difference]: With dead ends: 5018 [2022-01-28 13:42:47,867 INFO L226 Difference]: Without dead ends: 4978 [2022-01-28 13:42:47,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 239 SyntacticMatches, 10 SemanticMatches, 158 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8103 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2025, Invalid=22162, Unknown=9, NotChecked=1244, Total=25440 [2022-01-28 13:42:47,869 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 2320 mSDsluCounter, 9050 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 8722 SdHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2926 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:42:47,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2320 Valid, 8722 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1957 Invalid, 0 Unknown, 2926 Unchecked, 0.7s Time] [2022-01-28 13:42:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2022-01-28 13:42:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 3694. [2022-01-28 13:42:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3693 states have (on average 2.62144597887896) internal successors, (9681), 3693 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 9681 transitions. [2022-01-28 13:42:47,931 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 9681 transitions. Word has length 139 [2022-01-28 13:42:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:42:47,931 INFO L470 AbstractCegarLoop]: Abstraction has 3694 states and 9681 transitions. [2022-01-28 13:42:47,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.3703703703703702) internal successors, (364), 108 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:42:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 9681 transitions. [2022-01-28 13:42:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:42:47,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:42:47,936 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:42:47,953 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-01-28 13:42:48,151 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,SelfDestructingSolverStorable42 [2022-01-28 13:42:48,151 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:42:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:42:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1165329798, now seen corresponding path program 36 times [2022-01-28 13:42:48,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:42:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490105479] [2022-01-28 13:42:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:42:48,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:42:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:42:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:49,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:42:49,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490105479] [2022-01-28 13:42:49,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490105479] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:42:49,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676824325] [2022-01-28 13:42:49,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:42:49,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:42:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:42:49,973 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-01-28 13:42:49,974 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-01-28 13:42:50,089 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-28 13:42:50,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:42:50,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-28 13:42:50,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:42:51,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:42:51,765 INFO L388 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 30 treesize of output 30 [2022-01-28 13:42:52,278 INFO L354 Elim1Store]: treesize reduction 43, result has 21.8 percent of original size [2022-01-28 13:42:52,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 25 [2022-01-28 13:42:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:42:52,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:42:53,378 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~q_back~0 (+ c_~q_front~0 1)) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:53,446 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~q_back~0 (+ c_~q_front~0 1)) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:53,480 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~q_back~0 (+ c_~q_front~0 1)) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0)) is different from false [2022-01-28 13:42:53,497 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~q_back~0 (+ c_~q_front~0 1)) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:42:54,023 INFO L354 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-01-28 13:42:54,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 128 [2022-01-28 13:42:54,029 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:54,030 INFO L388 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 79 treesize of output 66 [2022-01-28 13:42:54,035 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:42:54,035 INFO L388 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 66 treesize of output 53 [2022-01-28 13:42:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-28 13:42:57,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676824325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:42:57,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:42:57,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 39, 39] total 112 [2022-01-28 13:42:57,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142579995] [2022-01-28 13:42:57,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:42:57,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-01-28 13:42:57,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:42:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-01-28 13:42:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=10828, Unknown=16, NotChecked=860, Total=12432 [2022-01-28 13:42:57,200 INFO L87 Difference]: Start difference. First operand 3694 states and 9681 transitions. Second operand has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:25,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#memory_int| c_~q~0.base))) (let ((.cse1 (select .cse41 (+ c_~q~0.offset (* c_~q_front~0 4)))) (.cse40 (* 4 c_~q_back~0)) (.cse42 (* 4 c_~q_front~0)) (.cse29 (<= c_~n~0 (+ 2 c_~q_front~0)))) (let ((.cse18 (<= c_~n~0 (+ 3 c_~q_front~0))) (.cse20 (or .cse29 (<= c_~s~0 0))) (.cse21 (or .cse29 (= .cse40 .cse42))) (.cse22 (or (<= 0 c_~s~0) .cse29)) (.cse23 (+ .cse1 1)) (.cse2 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (let ((.cse8 (<= 1 c_~q_front~0)) (.cse9 (= .cse1 1)) (.cse11 (<= (+ c_~q~0.offset .cse42) 4)) (.cse19 (or .cse29 .cse2)) (.cse3 (<= (+ c_~n~0 c_~q_front~0) (+ c_~q_back~0 1))) (.cse4 (<= .cse23 c_~N~0)) (.cse5 (<= 0 c_~q_front~0)) (.cse6 (= (select .cse41 4) 1)) (.cse7 (= c_~s~0 0)) (.cse0 (<= (* 4 c_~n~0) (+ .cse40 c_~q~0.offset 3))) (.cse30 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (forall ((~q_back~0 Int)) (or (<= ~q_back~0 c_~q_front~0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* ~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 (+ ~q_back~0 1))))) (.cse35 (and .cse18 .cse20 .cse21 .cse22 (or .cse29 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (.cse13 (< c_~q_front~0 0))) (and (or .cse0 (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or (let ((.cse10 (+ c_~s~0 1))) (and .cse8 .cse9 (<= .cse10 c_~N~0) .cse11 (<= c_~N~0 .cse10))) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) c_~s~0 (select .cse14 (+ c_~q~0.offset .cse15)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) c_~s~0 (select .cse16 (+ c_~q~0.offset .cse17)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22) .cse13) (or (and .cse2 .cse3 .cse4 (<= c_~N~0 .cse23) .cse5 .cse6 .cse7) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse25 (* c_~q_front~0 4))) (+ (select .cse24 (+ c_~q~0.offset 4 .cse25)) c_~s~0 (select .cse24 (+ c_~q~0.offset .cse25)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse27 (* c_~q_front~0 4))) (+ (select .cse26 (+ c_~q~0.offset 4 .cse27)) c_~s~0 (select .cse26 (+ c_~q~0.offset .cse27)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))))) (or (let ((.cse28 (+ |c_thread2Thread1of1ForFork0_~j~0#1| 1))) (and .cse8 .cse9 (<= c_~N~0 .cse28) (<= .cse28 c_~N~0) .cse11 .cse7)) .cse0) (or (and .cse18 (or .cse29 (< |c_ULTIMATE.start_main_#t~ret11#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse29 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse30 (and .cse18 (or .cse29 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse32 (* c_~q_front~0 4))) (+ (select .cse31 (+ c_~q~0.offset 4 .cse32)) c_~s~0 (select .cse31 (+ c_~q~0.offset .cse32)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse34 (* c_~q_front~0 4))) (+ (select .cse33 (+ c_~q~0.offset 4 .cse34)) c_~s~0 (select .cse33 (+ c_~q~0.offset .cse34)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) .cse13) (or (and .cse18 (or .cse29 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse29 (<= c_~s~0 |c_thread1Thread1of1ForFork1_~i~0#1|)) .cse19 (or .cse29 (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~s~0)) .cse21) .cse13) (or (and (<= |c_thread1Thread1of1ForFork1_#t~post1#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) (or .cse35 .cse30 .cse13) (= c_~q~0.offset 0) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse37 (* c_~q_front~0 4))) (+ (select .cse36 (+ c_~q~0.offset 4 .cse37)) c_~s~0 (select .cse36 (+ c_~q~0.offset .cse37)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse39 (* c_~q_front~0 4))) (+ (select .cse38 (+ c_~q~0.offset 4 .cse39)) c_~s~0 (select .cse38 (+ c_~q~0.offset .cse39)))) c_~N~0))) .cse13 (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) (or .cse35 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse13)))))) is different from false [2022-01-28 13:43:30,796 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse48 (select |c_#memory_int| c_~q~0.base))) (let ((.cse1 (select .cse48 (+ c_~q~0.offset (* c_~q_front~0 4)))) (.cse47 (* 4 c_~q_back~0)) (.cse50 (* 4 c_~q_front~0)) (.cse35 (<= c_~n~0 (+ 2 c_~q_front~0)))) (let ((.cse18 (<= c_~n~0 (+ 3 c_~q_front~0))) (.cse20 (or .cse35 (<= c_~s~0 0))) (.cse21 (or .cse35 (= .cse47 .cse50))) (.cse22 (or (<= 0 c_~s~0) .cse35)) (.cse29 (+ .cse1 1)) (.cse2 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse49 (+ c_~n~0 c_~q_front~0)) (.cse42 (+ .cse47 c_~q~0.offset))) (let ((.cse8 (<= 1 c_~q_front~0)) (.cse9 (= .cse1 1)) (.cse11 (<= (+ c_~q~0.offset .cse50) 4)) (.cse28 (not (= 0 .cse42))) (.cse27 (not (= (select .cse48 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1))) (.cse25 (<= c_~q_back~0 c_~q_front~0)) (.cse26 (<= .cse49 (+ 3 c_~q_back~0))) (.cse19 (or .cse35 .cse2)) (.cse3 (<= .cse49 (+ c_~q_back~0 1))) (.cse4 (<= .cse29 c_~N~0)) (.cse5 (<= 0 c_~q_front~0)) (.cse6 (= (select .cse48 4) 1)) (.cse7 (= c_~s~0 0)) (.cse0 (<= (* 4 c_~n~0) (+ .cse47 c_~q~0.offset 3))) (.cse36 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (forall ((~q_back~0 Int)) (or (<= ~q_back~0 c_~q_front~0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* ~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 (+ ~q_back~0 1))))) (.cse41 (and .cse18 .cse20 .cse21 .cse22 (or .cse35 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (.cse13 (< c_~q_front~0 0))) (and (or .cse0 (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or (let ((.cse10 (+ c_~s~0 1))) (and .cse8 .cse9 (<= .cse10 c_~N~0) .cse11 (<= c_~N~0 .cse10))) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) c_~s~0 (select .cse14 (+ c_~q~0.offset .cse15)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) c_~s~0 (select .cse16 (+ c_~q~0.offset .cse17)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22) .cse13) (let ((.cse23 (+ c_~q_front~0 1))) (or (< .cse23 0) (<= c_~n~0 .cse23) (<= c_~q_back~0 .cse23) (let ((.cse24 (+ .cse1 c_~s~0))) (and (<= c_~N~0 .cse24) (<= .cse24 c_~N~0))))) (or (and (or (and .cse25 .cse26 .cse7) .cse27) (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) .cse2) .cse28) (or (and .cse2 .cse3 .cse4 (<= c_~N~0 .cse29) .cse5 .cse6 .cse7) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse31 (* c_~q_front~0 4))) (+ (select .cse30 (+ c_~q~0.offset 4 .cse31)) c_~s~0 (select .cse30 (+ c_~q~0.offset .cse31)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse33 (* c_~q_front~0 4))) (+ (select .cse32 (+ c_~q~0.offset 4 .cse33)) c_~s~0 (select .cse32 (+ c_~q~0.offset .cse33)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))))) (or (let ((.cse34 (+ |c_thread2Thread1of1ForFork0_~j~0#1| 1))) (and .cse8 .cse9 (<= c_~N~0 .cse34) (<= .cse34 c_~N~0) .cse11 .cse7)) .cse0) (or .cse28 (and .cse2 (or .cse27 (and .cse25 .cse26 (= |c_thread1Thread1of1ForFork1_~i~0#1| 0) .cse7)))) (or (and .cse18 (or .cse35 (< |c_ULTIMATE.start_main_#t~ret11#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse35 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse36 (and .cse18 (or .cse35 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse38 (* c_~q_front~0 4))) (+ (select .cse37 (+ c_~q~0.offset 4 .cse38)) c_~s~0 (select .cse37 (+ c_~q~0.offset .cse38)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse40 (* c_~q_front~0 4))) (+ (select .cse39 (+ c_~q~0.offset 4 .cse40)) c_~s~0 (select .cse39 (+ c_~q~0.offset .cse40)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) .cse13) (or (and .cse18 (or .cse35 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse35 (<= c_~s~0 |c_thread1Thread1of1ForFork1_~i~0#1|)) .cse19 (or .cse35 (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~s~0)) .cse21) .cse13) (or (and (<= |c_thread1Thread1of1ForFork1_#t~post1#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) (or .cse41 .cse36 .cse13) (or (<= c_~n~0 3) (<= .cse42 0)) (= c_~q~0.offset 0) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse44 (* c_~q_front~0 4))) (+ (select .cse43 (+ c_~q~0.offset 4 .cse44)) c_~s~0 (select .cse43 (+ c_~q~0.offset .cse44)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse46 (* c_~q_front~0 4))) (+ (select .cse45 (+ c_~q~0.offset 4 .cse46)) c_~s~0 (select .cse45 (+ c_~q~0.offset .cse46)))) c_~N~0))) .cse13 (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) (or .cse41 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse13)))))) is different from false [2022-01-28 13:43:32,048 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse42 (select |c_#memory_int| c_~q~0.base))) (let ((.cse1 (select .cse42 (+ c_~q~0.offset (* c_~q_front~0 4)))) (.cse41 (* 4 c_~q_back~0)) (.cse43 (* 4 c_~q_front~0)) (.cse30 (<= c_~n~0 (+ 2 c_~q_front~0)))) (let ((.cse18 (<= c_~n~0 (+ 3 c_~q_front~0))) (.cse20 (or .cse30 (<= c_~s~0 0))) (.cse21 (or .cse30 (= .cse41 .cse43))) (.cse22 (or (<= 0 c_~s~0) .cse30)) (.cse24 (+ .cse1 1)) (.cse2 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (let ((.cse8 (<= 1 c_~q_front~0)) (.cse9 (= .cse1 1)) (.cse11 (<= (+ c_~q~0.offset .cse43) 4)) (.cse23 (+ |c_thread2Thread1of1ForFork0_~j~0#1| c_~N~0)) (.cse10 (+ c_~s~0 1)) (.cse19 (or .cse30 .cse2)) (.cse3 (<= (+ c_~n~0 c_~q_front~0) (+ c_~q_back~0 1))) (.cse4 (<= .cse24 c_~N~0)) (.cse5 (<= 0 c_~q_front~0)) (.cse6 (= (select .cse42 4) 1)) (.cse7 (= c_~s~0 0)) (.cse0 (<= (* 4 c_~n~0) (+ .cse41 c_~q~0.offset 3))) (.cse31 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (forall ((~q_back~0 Int)) (or (<= ~q_back~0 c_~q_front~0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* ~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 (+ ~q_back~0 1))))) (.cse36 (and .cse18 .cse20 .cse21 .cse22 (or .cse30 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (.cse13 (< c_~q_front~0 0))) (and (or .cse0 (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or (and .cse8 .cse9 (<= .cse10 c_~N~0) .cse11 (<= c_~N~0 .cse10)) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) c_~s~0 (select .cse14 (+ c_~q~0.offset .cse15)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) c_~s~0 (select .cse16 (+ c_~q~0.offset .cse17)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22) .cse13) (<= .cse10 .cse23) (or (and .cse2 .cse3 .cse4 (<= c_~N~0 .cse24) .cse5 .cse6 .cse7) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse26 (* c_~q_front~0 4))) (+ (select .cse25 (+ c_~q~0.offset 4 .cse26)) c_~s~0 (select .cse25 (+ c_~q~0.offset .cse26)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse28 (* c_~q_front~0 4))) (+ (select .cse27 (+ c_~q~0.offset 4 .cse28)) c_~s~0 (select .cse27 (+ c_~q~0.offset .cse28)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))))) (or (let ((.cse29 (+ |c_thread2Thread1of1ForFork0_~j~0#1| 1))) (and .cse8 .cse9 (<= c_~N~0 .cse29) (<= .cse29 c_~N~0) .cse11 .cse7)) .cse0) (or (and .cse18 (or .cse30 (< |c_ULTIMATE.start_main_#t~ret11#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse30 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse31 (and .cse18 (or .cse30 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse33 (* c_~q_front~0 4))) (+ (select .cse32 (+ c_~q~0.offset 4 .cse33)) c_~s~0 (select .cse32 (+ c_~q~0.offset .cse33)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse35 (* c_~q_front~0 4))) (+ (select .cse34 (+ c_~q~0.offset 4 .cse35)) c_~s~0 (select .cse34 (+ c_~q~0.offset .cse35)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) .cse13) (<= .cse23 .cse10) (= |c_thread2Thread1of1ForFork0_~j~0#1| 1) (or (and .cse18 (or .cse30 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse30 (<= c_~s~0 |c_thread1Thread1of1ForFork1_~i~0#1|)) .cse19 (or .cse30 (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~s~0)) .cse21) .cse13) (or (and (<= |c_thread1Thread1of1ForFork1_#t~post1#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) (or .cse36 .cse31 .cse13) (= c_~q~0.offset 0) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse38 (* c_~q_front~0 4))) (+ (select .cse37 (+ c_~q~0.offset 4 .cse38)) c_~s~0 (select .cse37 (+ c_~q~0.offset .cse38)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse40 (* c_~q_front~0 4))) (+ (select .cse39 (+ c_~q~0.offset 4 .cse40)) c_~s~0 (select .cse39 (+ c_~q~0.offset .cse40)))) c_~N~0))) .cse13 (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) (or .cse36 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse13)))))) is different from false [2022-01-28 13:43:35,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse45 (* 4 c_~q_back~0)) (.cse47 (* 4 c_~q_front~0)) (.cse46 (select |c_#memory_int| c_~q~0.base))) (let ((.cse1 (select .cse46 (+ c_~q~0.offset (* c_~q_front~0 4)))) (.cse26 (<= 0 c_~s~0)) (.cse25 (= .cse45 .cse47)) (.cse33 (<= c_~n~0 (+ 2 c_~q_front~0))) (.cse24 (<= c_~s~0 0))) (let ((.cse18 (<= c_~n~0 (+ 3 c_~q_front~0))) (.cse20 (or .cse33 .cse24)) (.cse21 (or .cse33 .cse25)) (.cse22 (or .cse26 .cse33)) (.cse23 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse27 (+ .cse1 1)) (.cse2 (not (= c_~q~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (let ((.cse8 (<= 1 c_~q_front~0)) (.cse9 (= .cse1 1)) (.cse11 (<= (+ c_~q~0.offset .cse47) 4)) (.cse19 (or .cse33 .cse2)) (.cse3 (<= (+ c_~n~0 c_~q_front~0) (+ c_~q_back~0 1))) (.cse4 (<= .cse27 c_~N~0)) (.cse5 (<= 0 c_~q_front~0)) (.cse6 (= (select .cse46 4) 1)) (.cse7 (= c_~s~0 0)) (.cse0 (<= (* 4 c_~n~0) (+ .cse45 c_~q~0.offset 3))) (.cse35 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (forall ((~q_back~0 Int)) (or (<= ~q_back~0 c_~q_front~0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* ~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 (+ ~q_back~0 1))))) (.cse40 (and .cse18 .cse20 .cse21 .cse22 (or .cse33 .cse23))) (.cse13 (< c_~q_front~0 0))) (and (or .cse0 (and (<= |c_thread1Thread1of1ForFork1_~i~0#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or (let ((.cse10 (+ c_~s~0 1))) (and .cse8 .cse9 (<= .cse10 c_~N~0) .cse11 (<= c_~N~0 .cse10))) .cse0) (= c_~s~0 (+ |c_thread2Thread1of1ForFork0_~j~0#1| 2)) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse15 (* c_~q_front~0 4))) (+ (select .cse14 (+ c_~q~0.offset 4 .cse15)) c_~s~0 (select .cse14 (+ c_~q~0.offset .cse15)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse17 (* c_~q_front~0 4))) (+ (select .cse16 (+ c_~q~0.offset 4 .cse17)) c_~s~0 (select .cse16 (+ c_~q~0.offset .cse17)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22) .cse13) (or (and (or .cse8 .cse23) (or .cse24 .cse8) (or .cse25 .cse8) (or .cse26 .cse8)) .cse13) (or (and .cse2 .cse3 .cse4 (<= c_~N~0 .cse27) .cse5 .cse6 .cse7) .cse0) (or .cse12 .cse13 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse29 (* c_~q_front~0 4))) (+ (select .cse28 (+ c_~q~0.offset 4 .cse29)) c_~s~0 (select .cse28 (+ c_~q~0.offset .cse29)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse31 (* c_~q_front~0 4))) (+ (select .cse30 (+ c_~q~0.offset 4 .cse31)) c_~s~0 (select .cse30 (+ c_~q~0.offset .cse31)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))))) (or (let ((.cse32 (+ |c_thread2Thread1of1ForFork0_~j~0#1| 1))) (and .cse8 .cse9 (<= c_~N~0 .cse32) (<= .cse32 c_~N~0) .cse11 .cse7)) .cse0) (= 2 c_~s~0) (or (and .cse18 (or .cse33 (< |c_ULTIMATE.start_main_#t~ret11#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (<= c_~N~0 c_~s~0) (or (and .cse18 (or .cse33 (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (<= c_~n~0 c_~q_front~0) (<= c_~q_back~0 c_~q_front~0) .cse13 (let ((.cse34 (+ |c_thread2Thread1of1ForFork0_~j~0#1| c_~s~0))) (and (<= c_~N~0 .cse34) (<= .cse34 c_~N~0)))) (<= c_~s~0 c_~N~0) (or .cse35 (and .cse18 (or .cse33 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse37 (* c_~q_front~0 4))) (+ (select .cse36 (+ c_~q~0.offset 4 .cse37)) c_~s~0 (select .cse36 (+ c_~q~0.offset .cse37)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse39 (* c_~q_front~0 4))) (+ (select .cse38 (+ c_~q~0.offset 4 .cse39)) c_~s~0 (select .cse38 (+ c_~q~0.offset .cse39)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) .cse13) (or (and .cse18 (or .cse33 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse20 .cse21 .cse22) .cse13) (or (and .cse18 (or .cse33 (<= c_~s~0 |c_thread1Thread1of1ForFork1_~i~0#1|)) .cse19 (or .cse33 (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~s~0)) .cse21) .cse13) (or (and (<= |c_thread1Thread1of1ForFork1_#t~post1#1| .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0) (or .cse40 .cse35 .cse13) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~q~0.offset 0) (or .cse12 (and (forall ((v_ArrVal_1313 (Array Int Int))) (<= c_~N~0 (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse42 (* c_~q_front~0 4))) (+ (select .cse41 (+ c_~q~0.offset 4 .cse42)) c_~s~0 (select .cse41 (+ c_~q~0.offset .cse42)))))) (forall ((v_ArrVal_1313 (Array Int Int))) (<= (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1313) c_~q~0.base)) (.cse44 (* c_~q_front~0 4))) (+ (select .cse43 (+ c_~q~0.offset 4 .cse44)) c_~s~0 (select .cse43 (+ c_~q~0.offset .cse44)))) c_~N~0))) .cse13 (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) (or .cse40 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse13)))))) is different from false [2022-01-28 13:43:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:43:37,953 INFO L93 Difference]: Finished difference Result 8731 states and 21866 transitions. [2022-01-28 13:43:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-01-28 13:43:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 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 139 [2022-01-28 13:43:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:43:37,965 INFO L225 Difference]: With dead ends: 8731 [2022-01-28 13:43:37,966 INFO L226 Difference]: Without dead ends: 8513 [2022-01-28 13:43:37,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 223 SyntacticMatches, 57 SemanticMatches, 297 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 34452 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=7179, Invalid=77196, Unknown=47, NotChecked=4680, Total=89102 [2022-01-28 13:43:37,969 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 6023 mSDsluCounter, 16855 mSDsCounter, 0 mSdLazyCounter, 10045 mSolverCounterSat, 937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6023 SdHoareTripleChecker+Valid, 15617 SdHoareTripleChecker+Invalid, 17573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 10045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6591 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:43:37,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6023 Valid, 15617 Invalid, 17573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [937 Valid, 10045 Invalid, 0 Unknown, 6591 Unchecked, 4.8s Time] [2022-01-28 13:43:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8513 states. [2022-01-28 13:43:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8513 to 3965. [2022-01-28 13:43:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3964 states have (on average 2.599394550958628) internal successors, (10304), 3964 states have internal predecessors, (10304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 10304 transitions. [2022-01-28 13:43:38,072 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 10304 transitions. Word has length 139 [2022-01-28 13:43:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:43:38,072 INFO L470 AbstractCegarLoop]: Abstraction has 3965 states and 10304 transitions. [2022-01-28 13:43:38,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 10304 transitions. [2022-01-28 13:43:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:43:38,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:43:38,077 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:43:38,094 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-01-28 13:43:38,299 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,SelfDestructingSolverStorable43 [2022-01-28 13:43:38,299 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:43:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:43:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1030673336, now seen corresponding path program 37 times [2022-01-28 13:43:38,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:43:38,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757131158] [2022-01-28 13:43:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:43:38,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:43:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:43:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:43:39,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:43:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757131158] [2022-01-28 13:43:39,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757131158] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:43:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959198043] [2022-01-28 13:43:39,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:43:39,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:43:39,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:43:39,864 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-01-28 13:43:39,865 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-01-28 13:43:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:43:39,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-28 13:43:39,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:43:40,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:43:40,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:43:40,302 INFO L388 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-01-28 13:43:42,025 INFO L388 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 29 treesize of output 29 [2022-01-28 13:43:42,660 INFO L354 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-01-28 13:43:42,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-01-28 13:43:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:43:42,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:43:44,207 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:43:44,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 161 [2022-01-28 13:43:44,213 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:43:44,213 INFO L388 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 93 treesize of output 61 [2022-01-28 13:43:46,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:43:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:43:46,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959198043] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:43:46,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:43:46,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 108 [2022-01-28 13:43:46,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863698632] [2022-01-28 13:43:46,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:43:46,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:43:46,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:43:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:43:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=10644, Unknown=18, NotChecked=0, Total=11556 [2022-01-28 13:43:46,829 INFO L87 Difference]: Start difference. First operand 3965 states and 10304 transitions. Second operand has 108 states, 108 states have (on average 3.3518518518518516) internal successors, (362), 108 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:43:54,118 INFO L93 Difference]: Finished difference Result 5377 states and 13826 transitions. [2022-01-28 13:43:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-28 13:43:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.3518518518518516) internal successors, (362), 108 states have internal predecessors, (362), 0 states have call successors, (0), 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 139 [2022-01-28 13:43:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:43:54,126 INFO L225 Difference]: With dead ends: 5377 [2022-01-28 13:43:54,126 INFO L226 Difference]: Without dead ends: 5108 [2022-01-28 13:43:54,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 229 SyntacticMatches, 11 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8877 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2543, Invalid=26159, Unknown=28, NotChecked=0, Total=28730 [2022-01-28 13:43:54,127 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 2872 mSDsluCounter, 10590 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 10033 SdHoareTripleChecker+Invalid, 6029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2505 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:43:54,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2872 Valid, 10033 Invalid, 6029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 3320 Invalid, 0 Unknown, 2505 Unchecked, 1.1s Time] [2022-01-28 13:43:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2022-01-28 13:43:54,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4255. [2022-01-28 13:43:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4254 states have (on average 2.5954395862717443) internal successors, (11041), 4254 states have internal predecessors, (11041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 11041 transitions. [2022-01-28 13:43:54,219 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 11041 transitions. Word has length 139 [2022-01-28 13:43:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:43:54,219 INFO L470 AbstractCegarLoop]: Abstraction has 4255 states and 11041 transitions. [2022-01-28 13:43:54,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.3518518518518516) internal successors, (362), 108 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:43:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 11041 transitions. [2022-01-28 13:43:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:43:54,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:43:54,239 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:43:54,257 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-01-28 13:43:54,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:43:54,440 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:43:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:43:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2011659514, now seen corresponding path program 38 times [2022-01-28 13:43:54,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:43:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429952971] [2022-01-28 13:43:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:43:54,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:43:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:43:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:43:55,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:43:55,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429952971] [2022-01-28 13:43:55,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429952971] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:43:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253141604] [2022-01-28 13:43:55,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:43:55,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:43:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:43:55,805 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-01-28 13:43:55,823 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-01-28 13:43:55,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:43:55,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:43:55,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-28 13:43:55,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:43:57,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:43:57,605 INFO L388 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 30 treesize of output 30 [2022-01-28 13:43:58,006 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:43:58,006 INFO L388 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 47 treesize of output 13 [2022-01-28 13:43:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:43:58,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:43:58,428 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0)))) is different from false [2022-01-28 13:43:58,465 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0)))) is different from false [2022-01-28 13:43:58,484 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0)))) is different from false [2022-01-28 13:43:58,494 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)))) c_~N~0)))) is different from false [2022-01-28 13:43:58,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= .cse0 c_~q_front~0) (<= c_~n~0 .cse0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= c_~N~0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)) (select .cse1 (+ c_~q~0.offset 4 .cse2)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4)) (select .cse3 (+ c_~q~0.offset 4 .cse4)))) c_~N~0))))) is different from false [2022-01-28 13:43:58,526 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q_back~0 1))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) (<= .cse4 c_~q_front~0) (<= c_~n~0 .cse4) (< c_~q_front~0 0))) is different from false [2022-01-28 13:43:58,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q_back~0 1))) (or (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)))))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= .cse4 c_~q_front~0) (<= c_~n~0 .cse4) (< c_~q_front~0 0))) is different from false [2022-01-28 13:43:58,559 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= .cse0 c_~q_front~0) (<= c_~n~0 .cse0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)) (select .cse1 (+ c_~q~0.offset 4 .cse2)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4)) (select .cse3 (+ c_~q~0.offset 4 .cse4))))))))) is different from false [2022-01-28 13:43:58,587 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:43:58,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:43:58,592 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:43:58,592 INFO L388 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 79 treesize of output 66 [2022-01-28 13:43:58,596 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:43:58,596 INFO L388 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 66 treesize of output 53 [2022-01-28 13:44:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-28 13:44:00,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253141604] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:44:00,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:44:00,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 106 [2022-01-28 13:44:00,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970604637] [2022-01-28 13:44:00,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:44:00,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-01-28 13:44:00,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:44:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-01-28 13:44:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=8700, Unknown=8, NotChecked=1592, Total=11130 [2022-01-28 13:44:00,075 INFO L87 Difference]: Start difference. First operand 4255 states and 11041 transitions. Second operand has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:05,301 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (<= 0 c_~s~0)) (.cse6 (= (* 4 c_~q_back~0) (* 4 c_~q_front~0))) (.cse7 (<= c_~s~0 0)) (.cse13 (+ 2 c_~q_back~0))) (let ((.cse3 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= .cse13 c_~q_front~0)) (.cse1 (and .cse5 .cse6 .cse7 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse4 (<= c_~n~0 .cse13)) (.cse2 (< c_~q_front~0 0))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (or .cse0 .cse1 (<= 1 c_~q_back~0) .cse2) (or .cse0 .cse3 .cse2 .cse4 (and .cse5 .cse6 .cse7 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (or (and .cse5 .cse6 .cse7 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse0 .cse3 .cse2 .cse4) (or .cse0 .cse3 .cse1 .cse2 .cse4) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0 .cse1 .cse2 .cse4) (let ((.cse12 (+ c_~q_back~0 1))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1380 (Array Int Int))) (<= (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse9 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse8 (+ c_~q~0.offset .cse9)) (select .cse8 (+ c_~q~0.offset 4 .cse9)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (forall ((v_ArrVal_1380 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1380) c_~q~0.base)) (.cse11 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse10 (+ c_~q~0.offset .cse11)) (select .cse10 (+ c_~q~0.offset 4 .cse11))))))) (<= .cse12 c_~q_front~0) (<= c_~n~0 .cse12) .cse2)) (= c_~s~0 0)))) is different from false [2022-01-28 13:44:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:44:11,274 INFO L93 Difference]: Finished difference Result 8665 states and 22724 transitions. [2022-01-28 13:44:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-01-28 13:44:11,274 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 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 139 [2022-01-28 13:44:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:44:11,287 INFO L225 Difference]: With dead ends: 8665 [2022-01-28 13:44:11,287 INFO L226 Difference]: Without dead ends: 7657 [2022-01-28 13:44:11,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 211 SyntacticMatches, 13 SemanticMatches, 198 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 11714 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3516, Invalid=32800, Unknown=10, NotChecked=3474, Total=39800 [2022-01-28 13:44:11,290 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 3810 mSDsluCounter, 10347 mSDsCounter, 0 mSdLazyCounter, 5925 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 9710 SdHoareTripleChecker+Invalid, 12964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 5925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6559 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:44:11,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3810 Valid, 9710 Invalid, 12964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 5925 Invalid, 0 Unknown, 6559 Unchecked, 2.4s Time] [2022-01-28 13:44:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7657 states. [2022-01-28 13:44:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7657 to 3339. [2022-01-28 13:44:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3339 states, 3338 states have (on average 2.6069502696225286) internal successors, (8702), 3338 states have internal predecessors, (8702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 8702 transitions. [2022-01-28 13:44:11,360 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 8702 transitions. Word has length 139 [2022-01-28 13:44:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:44:11,361 INFO L470 AbstractCegarLoop]: Abstraction has 3339 states and 8702 transitions. [2022-01-28 13:44:11,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 8702 transitions. [2022-01-28 13:44:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:44:11,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:44:11,365 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:44:11,382 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-01-28 13:44:11,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:44:11,582 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:44:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:44:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -447564780, now seen corresponding path program 39 times [2022-01-28 13:44:11,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:44:11,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387880388] [2022-01-28 13:44:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:44:11,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:44:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:44:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:13,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:44:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387880388] [2022-01-28 13:44:13,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387880388] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:44:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445774462] [2022-01-28 13:44:13,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:44:13,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:44:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:44:13,159 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-01-28 13:44:13,161 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-01-28 13:44:13,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:44:13,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:44:13,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-28 13:44:13,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:44:14,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:44:14,860 INFO L388 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 29 treesize of output 29 [2022-01-28 13:44:15,490 INFO L354 Elim1Store]: treesize reduction 81, result has 16.5 percent of original size [2022-01-28 13:44:15,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 28 [2022-01-28 13:44:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:44:15,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:44:17,052 INFO L354 Elim1Store]: treesize reduction 60, result has 38.1 percent of original size [2022-01-28 13:44:17,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 122 [2022-01-28 13:44:17,059 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-28 13:44:17,059 INFO L388 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 77 treesize of output 65 [2022-01-28 13:44:17,083 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-28 13:44:17,084 INFO L388 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 65 treesize of output 53 [2022-01-28 13:44:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:44:18,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445774462] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:44:18,221 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:44:18,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 29, 29] total 87 [2022-01-28 13:44:18,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178618239] [2022-01-28 13:44:18,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:44:18,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-01-28 13:44:18,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:44:18,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-01-28 13:44:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=6707, Unknown=7, NotChecked=0, Total=7482 [2022-01-28 13:44:18,223 INFO L87 Difference]: Start difference. First operand 3339 states and 8702 transitions. Second operand has 87 states, 87 states have (on average 3.7126436781609193) internal successors, (323), 87 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:44:24,521 INFO L93 Difference]: Finished difference Result 6723 states and 17216 transitions. [2022-01-28 13:44:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-01-28 13:44:24,521 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.7126436781609193) internal successors, (323), 87 states have internal predecessors, (323), 0 states have call successors, (0), 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 139 [2022-01-28 13:44:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:44:24,532 INFO L225 Difference]: With dead ends: 6723 [2022-01-28 13:44:24,532 INFO L226 Difference]: Without dead ends: 6705 [2022-01-28 13:44:24,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 250 SyntacticMatches, 16 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9893 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2861, Invalid=26544, Unknown=7, NotChecked=0, Total=29412 [2022-01-28 13:44:24,536 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 2317 mSDsluCounter, 9470 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 9342 SdHoareTripleChecker+Invalid, 3891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1961 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:44:24,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2317 Valid, 9342 Invalid, 3891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1871 Invalid, 0 Unknown, 1961 Unchecked, 0.7s Time] [2022-01-28 13:44:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2022-01-28 13:44:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 3992. [2022-01-28 13:44:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3991 states have (on average 2.5965923327486844) internal successors, (10363), 3991 states have internal predecessors, (10363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 10363 transitions. [2022-01-28 13:44:24,624 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 10363 transitions. Word has length 139 [2022-01-28 13:44:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:44:24,624 INFO L470 AbstractCegarLoop]: Abstraction has 3992 states and 10363 transitions. [2022-01-28 13:44:24,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.7126436781609193) internal successors, (323), 87 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 10363 transitions. [2022-01-28 13:44:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:44:24,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:44:24,629 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:44:24,659 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-01-28 13:44:24,846 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,SelfDestructingSolverStorable46 [2022-01-28 13:44:24,847 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:44:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:44:24,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1566198338, now seen corresponding path program 40 times [2022-01-28 13:44:24,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:44:24,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959908330] [2022-01-28 13:44:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:44:24,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:44:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:44:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:26,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:44:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959908330] [2022-01-28 13:44:26,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959908330] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:44:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136806200] [2022-01-28 13:44:26,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:44:26,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:44:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:44:26,289 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-01-28 13:44:26,289 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-01-28 13:44:26,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:44:26,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:44:26,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-28 13:44:26,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:44:28,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:44:28,739 INFO L388 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 29 treesize of output 29 [2022-01-28 13:44:29,826 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-01-28 13:44:29,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 19 [2022-01-28 13:44:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:29,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:44:30,379 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:30,426 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:30,450 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:30,464 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:30,482 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) c_~N~0))) (<= c_~n~0 (+ c_~q_back~0 1)) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:44:30,503 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:44:30,532 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:44:30,548 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1446 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1446 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1446) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3))))))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:44:30,593 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:44:30,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-01-28 13:44:30,600 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:44:30,601 INFO L388 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 79 treesize of output 66 [2022-01-28 13:44:30,607 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:44:30,607 INFO L388 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 66 treesize of output 53 [2022-01-28 13:44:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-28 13:44:32,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136806200] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:44:32,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:44:32,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 104 [2022-01-28 13:44:32,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870541134] [2022-01-28 13:44:32,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:44:32,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-01-28 13:44:32,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:44:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-01-28 13:44:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=8417, Unknown=8, NotChecked=1560, Total=10712 [2022-01-28 13:44:32,762 INFO L87 Difference]: Start difference. First operand 3992 states and 10363 transitions. Second operand has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:44:36,760 INFO L93 Difference]: Finished difference Result 5086 states and 13002 transitions. [2022-01-28 13:44:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-28 13:44:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:44:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:44:36,768 INFO L225 Difference]: With dead ends: 5086 [2022-01-28 13:44:36,768 INFO L226 Difference]: Without dead ends: 5068 [2022-01-28 13:44:36,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 224 SyntacticMatches, 18 SemanticMatches, 151 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7087 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1806, Invalid=19098, Unknown=8, NotChecked=2344, Total=23256 [2022-01-28 13:44:36,769 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 1662 mSDsluCounter, 7481 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 7279 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2270 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:44:36,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1662 Valid, 7279 Invalid, 3974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1650 Invalid, 0 Unknown, 2270 Unchecked, 0.5s Time] [2022-01-28 13:44:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-01-28 13:44:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4143. [2022-01-28 13:44:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 2.5924674070497344) internal successors, (10738), 4142 states have internal predecessors, (10738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 10738 transitions. [2022-01-28 13:44:36,835 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 10738 transitions. Word has length 139 [2022-01-28 13:44:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:44:36,835 INFO L470 AbstractCegarLoop]: Abstraction has 4143 states and 10738 transitions. [2022-01-28 13:44:36,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 10738 transitions. [2022-01-28 13:44:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:44:36,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:44:36,840 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:44:36,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-01-28 13:44:37,055 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,SelfDestructingSolverStorable47 [2022-01-28 13:44:37,056 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:44:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:44:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1934647568, now seen corresponding path program 41 times [2022-01-28 13:44:37,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:44:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696775401] [2022-01-28 13:44:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:44:37,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:44:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:44:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:38,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:44:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696775401] [2022-01-28 13:44:38,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696775401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:44:38,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812721486] [2022-01-28 13:44:38,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:44:38,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:44:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:44:38,267 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-01-28 13:44:38,274 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-01-28 13:44:38,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:44:38,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:44:38,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-28 13:44:38,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:44:40,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:44:40,093 INFO L388 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 29 treesize of output 29 [2022-01-28 13:44:40,913 INFO L354 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-01-28 13:44:40,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 19 [2022-01-28 13:44:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:41,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:44:41,563 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_1479 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))) c_~N~0)) (forall ((v_ArrVal_1479 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:41,633 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1479 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))) c_~N~0)) (forall ((v_ArrVal_1479 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:41,667 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_1479 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))) c_~N~0)) (forall ((v_ArrVal_1479 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:41,685 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_front~0) (and (forall ((v_ArrVal_1479 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset 4 .cse1)))) c_~N~0)) (forall ((v_ArrVal_1479 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset 4 .cse3))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:44:42,119 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:44:42,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-01-28 13:44:42,126 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:44:42,126 INFO L388 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 79 treesize of output 66 [2022-01-28 13:44:42,132 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:44:42,132 INFO L388 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 66 treesize of output 53 [2022-01-28 13:44:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 2 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-28 13:44:45,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812721486] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:44:45,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:44:45,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 106 [2022-01-28 13:44:45,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159557] [2022-01-28 13:44:45,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:44:45,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-01-28 13:44:45,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:44:45,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-01-28 13:44:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=9516, Unknown=17, NotChecked=812, Total=11130 [2022-01-28 13:44:45,812 INFO L87 Difference]: Start difference. First operand 4143 states and 10738 transitions. Second operand has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:44:50,018 INFO L93 Difference]: Finished difference Result 5820 states and 15141 transitions. [2022-01-28 13:44:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-01-28 13:44:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 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 139 [2022-01-28 13:44:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:44:50,027 INFO L225 Difference]: With dead ends: 5820 [2022-01-28 13:44:50,028 INFO L226 Difference]: Without dead ends: 5811 [2022-01-28 13:44:50,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 225 SyntacticMatches, 10 SemanticMatches, 156 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7565 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2017, Invalid=21544, Unknown=17, NotChecked=1228, Total=24806 [2022-01-28 13:44:50,029 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 2019 mSDsluCounter, 9796 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 9737 SdHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1593 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:44:50,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2019 Valid, 9737 Invalid, 3428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1752 Invalid, 0 Unknown, 1593 Unchecked, 0.6s Time] [2022-01-28 13:44:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2022-01-28 13:44:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 4149. [2022-01-28 13:44:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 4148 states have (on average 2.591610414657666) internal successors, (10750), 4148 states have internal predecessors, (10750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 10750 transitions. [2022-01-28 13:44:50,098 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 10750 transitions. Word has length 139 [2022-01-28 13:44:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:44:50,098 INFO L470 AbstractCegarLoop]: Abstraction has 4149 states and 10750 transitions. [2022-01-28 13:44:50,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:44:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 10750 transitions. [2022-01-28 13:44:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:44:50,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:44:50,103 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:44:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-01-28 13:44:50,319 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,SelfDestructingSolverStorable48 [2022-01-28 13:44:50,319 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:44:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:44:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1025912262, now seen corresponding path program 42 times [2022-01-28 13:44:50,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:44:50,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567808029] [2022-01-28 13:44:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:44:50,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:44:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:44:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:51,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:44:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567808029] [2022-01-28 13:44:51,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567808029] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:44:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829300666] [2022-01-28 13:44:51,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:44:51,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:44:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:44:51,471 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-01-28 13:44:51,473 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-01-28 13:44:51,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-28 13:44:51,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:44:51,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-28 13:44:51,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:44:53,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:44:54,001 INFO L388 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 30 treesize of output 30 [2022-01-28 13:44:54,771 INFO L354 Elim1Store]: treesize reduction 87, result has 15.5 percent of original size [2022-01-28 13:44:54,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 28 [2022-01-28 13:44:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:44:55,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:44:57,811 INFO L354 Elim1Store]: treesize reduction 60, result has 38.1 percent of original size [2022-01-28 13:44:57,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 143 [2022-01-28 13:44:57,822 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-28 13:44:57,822 INFO L388 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 91 treesize of output 61 [2022-01-28 13:45:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:00,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829300666] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:45:00,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:45:00,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 108 [2022-01-28 13:45:00,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139464364] [2022-01-28 13:45:00,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:45:00,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:45:00,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:45:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:45:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=10552, Unknown=5, NotChecked=0, Total=11556 [2022-01-28 13:45:00,528 INFO L87 Difference]: Start difference. First operand 4149 states and 10750 transitions. Second operand has 108 states, 108 states have (on average 3.25) internal successors, (351), 108 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:45:06,119 INFO L93 Difference]: Finished difference Result 6243 states and 16050 transitions. [2022-01-28 13:45:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-01-28 13:45:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.25) internal successors, (351), 108 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:45:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:45:06,129 INFO L225 Difference]: With dead ends: 6243 [2022-01-28 13:45:06,129 INFO L226 Difference]: Without dead ends: 6216 [2022-01-28 13:45:06,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 229 SyntacticMatches, 9 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 9753 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2669, Invalid=26056, Unknown=5, NotChecked=0, Total=28730 [2022-01-28 13:45:06,130 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 2088 mSDsluCounter, 10113 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2088 SdHoareTripleChecker+Valid, 9916 SdHoareTripleChecker+Invalid, 3675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1722 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:45:06,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2088 Valid, 9916 Invalid, 3675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1866 Invalid, 0 Unknown, 1722 Unchecked, 0.7s Time] [2022-01-28 13:45:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6216 states. [2022-01-28 13:45:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6216 to 4605. [2022-01-28 13:45:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 2.579278887923545) internal successors, (11875), 4604 states have internal predecessors, (11875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 11875 transitions. [2022-01-28 13:45:06,207 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 11875 transitions. Word has length 139 [2022-01-28 13:45:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:45:06,207 INFO L470 AbstractCegarLoop]: Abstraction has 4605 states and 11875 transitions. [2022-01-28 13:45:06,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.25) internal successors, (351), 108 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 11875 transitions. [2022-01-28 13:45:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:45:06,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:45:06,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:45:06,232 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-01-28 13:45:06,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:06,427 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:45:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:45:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1652511256, now seen corresponding path program 43 times [2022-01-28 13:45:06,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:45:06,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162194897] [2022-01-28 13:45:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:45:06,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:45:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:45:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:07,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:45:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162194897] [2022-01-28 13:45:07,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162194897] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:45:07,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224046449] [2022-01-28 13:45:07,840 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:45:07,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:45:07,841 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-01-28 13:45:07,842 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-01-28 13:45:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:45:07,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-28 13:45:07,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:45:08,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:45:08,274 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:45:08,274 INFO L388 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-01-28 13:45:10,096 INFO L388 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 30 treesize of output 30 [2022-01-28 13:45:10,665 INFO L354 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-01-28 13:45:10,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 19 [2022-01-28 13:45:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:10,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:45:11,811 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:45:11,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 161 [2022-01-28 13:45:11,816 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:45:11,817 INFO L388 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 93 treesize of output 61 [2022-01-28 13:45:13,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:45:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:13,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224046449] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:45:13,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:45:13,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 106 [2022-01-28 13:45:13,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094925234] [2022-01-28 13:45:13,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:45:13,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-01-28 13:45:13,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:45:13,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-01-28 13:45:13,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=10224, Unknown=21, NotChecked=0, Total=11130 [2022-01-28 13:45:13,933 INFO L87 Difference]: Start difference. First operand 4605 states and 11875 transitions. Second operand has 106 states, 106 states have (on average 3.311320754716981) internal successors, (351), 106 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:45:21,043 INFO L93 Difference]: Finished difference Result 6439 states and 16226 transitions. [2022-01-28 13:45:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-01-28 13:45:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 3.311320754716981) internal successors, (351), 106 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:45:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:45:21,054 INFO L225 Difference]: With dead ends: 6439 [2022-01-28 13:45:21,054 INFO L226 Difference]: Without dead ends: 6337 [2022-01-28 13:45:21,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 232 SyntacticMatches, 9 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10037 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2621, Invalid=29930, Unknown=29, NotChecked=0, Total=32580 [2022-01-28 13:45:21,056 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 2780 mSDsluCounter, 9751 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2780 SdHoareTripleChecker+Valid, 8749 SdHoareTripleChecker+Invalid, 7110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4147 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:45:21,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2780 Valid, 8749 Invalid, 7110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2763 Invalid, 0 Unknown, 4147 Unchecked, 1.1s Time] [2022-01-28 13:45:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2022-01-28 13:45:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 4579. [2022-01-28 13:45:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4579 states, 4578 states have (on average 2.575141983398864) internal successors, (11789), 4578 states have internal predecessors, (11789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 11789 transitions. [2022-01-28 13:45:21,155 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 11789 transitions. Word has length 139 [2022-01-28 13:45:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:45:21,156 INFO L470 AbstractCegarLoop]: Abstraction has 4579 states and 11789 transitions. [2022-01-28 13:45:21,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 3.311320754716981) internal successors, (351), 106 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 11789 transitions. [2022-01-28 13:45:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:45:21,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:45:21,162 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:45:21,179 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-01-28 13:45:21,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:21,368 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:45:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:45:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -525308866, now seen corresponding path program 44 times [2022-01-28 13:45:21,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:45:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762331636] [2022-01-28 13:45:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:45:21,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:45:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:45:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:22,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:45:22,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762331636] [2022-01-28 13:45:22,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762331636] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:45:22,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16200211] [2022-01-28 13:45:22,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:45:22,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:45:22,991 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-01-28 13:45:22,991 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-01-28 13:45:23,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:45:23,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:45:23,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 77 conjunts are in the unsatisfiable core [2022-01-28 13:45:23,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:45:24,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:45:24,882 INFO L388 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 30 treesize of output 30 [2022-01-28 13:45:25,258 INFO L354 Elim1Store]: treesize reduction 99, result has 6.6 percent of original size [2022-01-28 13:45:25,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 19 [2022-01-28 13:45:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:25,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:45:25,658 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) is different from false [2022-01-28 13:45:25,705 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:45:25,735 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:45:25,751 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:45:25,760 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:45:25,772 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:45:25,786 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:45:25,803 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0)))))) is different from false [2022-01-28 13:45:25,812 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:45:25,837 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:45:25,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:45:25,843 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:45:25,843 INFO L388 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 79 treesize of output 66 [2022-01-28 13:45:25,847 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:45:25,847 INFO L388 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 66 treesize of output 53 [2022-01-28 13:45:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-28 13:45:27,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16200211] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:45:27,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:45:27,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 104 [2022-01-28 13:45:27,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617008525] [2022-01-28 13:45:27,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:45:27,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-01-28 13:45:27,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:45:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-01-28 13:45:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=8229, Unknown=9, NotChecked=1746, Total=10712 [2022-01-28 13:45:27,279 INFO L87 Difference]: Start difference. First operand 4579 states and 11789 transitions. Second operand has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:31,383 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 c_~s~0)) (.cse1 (= (* 4 c_~q_back~0) (* 4 c_~q_front~0))) (.cse2 (<= c_~s~0 0))) (let ((.cse3 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (and .cse0 .cse1 .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse4 (< c_~q_back~0 0)) (.cse5 (<= c_~n~0 (+ 2 c_~q_back~0)))) (and (or (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse3 .cse4 .cse5) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse6 (<= 1 c_~q_back~0) .cse4) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse4 .cse5) (or .cse3 .cse4 .cse5 (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (= c_~s~0 0) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse8 (* c_~q_front~0 4))) (+ (select .cse7 (+ c_~q~0.offset 4 .cse8)) (select .cse7 (+ c_~q~0.offset .cse8)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse10 (* c_~q_front~0 4))) (+ (select .cse9 (+ c_~q~0.offset 4 .cse10)) (select .cse9 (+ c_~q~0.offset .cse10)) c_~s~0)))))) (or .cse3 .cse6 .cse4 .cse5)))) is different from false [2022-01-28 13:45:34,582 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)))) is different from false [2022-01-28 13:45:35,643 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (or (and (forall ((v_ArrVal_1579 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) (select .cse0 (+ c_~q~0.offset .cse1)) c_~s~0)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1579 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1579) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) (select .cse2 (+ c_~q~0.offset .cse3)) c_~s~0))))) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)))) is different from false [2022-01-28 13:45:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:45:37,373 INFO L93 Difference]: Finished difference Result 8810 states and 22889 transitions. [2022-01-28 13:45:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-01-28 13:45:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:45:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:45:37,386 INFO L225 Difference]: With dead ends: 8810 [2022-01-28 13:45:37,386 INFO L226 Difference]: Without dead ends: 8708 [2022-01-28 13:45:37,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 217 SyntacticMatches, 28 SemanticMatches, 191 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 10622 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=3140, Invalid=29463, Unknown=25, NotChecked=4428, Total=37056 [2022-01-28 13:45:37,387 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 2900 mSDsluCounter, 10392 mSDsCounter, 0 mSdLazyCounter, 4511 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 9845 SdHoareTripleChecker+Invalid, 9252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 4511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4411 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:45:37,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2900 Valid, 9845 Invalid, 9252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 4511 Invalid, 0 Unknown, 4411 Unchecked, 1.7s Time] [2022-01-28 13:45:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8708 states. [2022-01-28 13:45:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8708 to 4754. [2022-01-28 13:45:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4753 states have (on average 2.566379128971176) internal successors, (12198), 4753 states have internal predecessors, (12198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 12198 transitions. [2022-01-28 13:45:37,480 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 12198 transitions. Word has length 139 [2022-01-28 13:45:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:45:37,480 INFO L470 AbstractCegarLoop]: Abstraction has 4754 states and 12198 transitions. [2022-01-28 13:45:37,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 12198 transitions. [2022-01-28 13:45:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:45:37,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:45:37,486 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:45:37,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-01-28 13:45:37,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:37,691 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:45:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:45:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -279587042, now seen corresponding path program 45 times [2022-01-28 13:45:37,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:45:37,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723388407] [2022-01-28 13:45:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:45:37,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:45:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:45:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:38,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:45:38,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723388407] [2022-01-28 13:45:38,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723388407] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:45:38,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912311094] [2022-01-28 13:45:38,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:45:38,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:38,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:45:38,826 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-01-28 13:45:38,891 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-01-28 13:45:39,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:45:39,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:45:39,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-28 13:45:39,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:45:39,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:45:39,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:45:39,302 INFO L388 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-01-28 13:45:40,200 INFO L388 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 30 treesize of output 30 [2022-01-28 13:45:40,508 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:45:40,508 INFO L388 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 47 treesize of output 13 [2022-01-28 13:45:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:45:40,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:45:42,006 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:45:42,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 183 [2022-01-28 13:45:42,012 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:45:42,012 INFO L388 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 107 treesize of output 68 [2022-01-28 13:45:42,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:45:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:45:42,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912311094] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:45:42,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:45:42,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 29, 29] total 83 [2022-01-28 13:45:42,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338310308] [2022-01-28 13:45:42,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:45:42,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-01-28 13:45:42,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:45:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-01-28 13:45:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=6509, Unknown=6, NotChecked=0, Total=6806 [2022-01-28 13:45:42,910 INFO L87 Difference]: Start difference. First operand 4754 states and 12198 transitions. Second operand has 83 states, 83 states have (on average 3.7228915662650603) internal successors, (309), 83 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-01-28 13:45:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:45:57,395 INFO L93 Difference]: Finished difference Result 11021 states and 28365 transitions. [2022-01-28 13:45:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2022-01-28 13:45:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.7228915662650603) internal successors, (309), 83 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 139 [2022-01-28 13:45:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:45:57,411 INFO L225 Difference]: With dead ends: 11021 [2022-01-28 13:45:57,411 INFO L226 Difference]: Without dead ends: 10518 [2022-01-28 13:45:57,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 246 SyntacticMatches, 23 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15125 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2828, Invalid=42748, Unknown=6, NotChecked=0, Total=45582 [2022-01-28 13:45:57,427 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 3810 mSDsluCounter, 17815 mSDsCounter, 0 mSdLazyCounter, 10751 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 13651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 10751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2461 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-28 13:45:57,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3810 Valid, 16506 Invalid, 13651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 10751 Invalid, 0 Unknown, 2461 Unchecked, 3.8s Time] [2022-01-28 13:45:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2022-01-28 13:45:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 5119. [2022-01-28 13:45:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5119 states, 5118 states have (on average 2.5803048065650644) internal successors, (13206), 5118 states have internal predecessors, (13206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:45:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5119 states to 5119 states and 13206 transitions. [2022-01-28 13:45:57,527 INFO L78 Accepts]: Start accepts. Automaton has 5119 states and 13206 transitions. Word has length 139 [2022-01-28 13:45:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:45:57,528 INFO L470 AbstractCegarLoop]: Abstraction has 5119 states and 13206 transitions. [2022-01-28 13:45:57,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.7228915662650603) internal successors, (309), 83 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-01-28 13:45:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5119 states and 13206 transitions. [2022-01-28 13:45:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:45:57,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:45:57,533 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:45:57,551 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-01-28 13:45:57,750 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,SelfDestructingSolverStorable52 [2022-01-28 13:45:57,751 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:45:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:45:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1228617126, now seen corresponding path program 46 times [2022-01-28 13:45:57,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:45:57,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154675647] [2022-01-28 13:45:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:45:57,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:45:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:45:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:45:59,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:45:59,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154675647] [2022-01-28 13:45:59,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154675647] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:45:59,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403841773] [2022-01-28 13:45:59,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:45:59,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:45:59,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:45:59,107 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-01-28 13:45:59,108 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-01-28 13:45:59,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:45:59,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:45:59,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-28 13:45:59,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:46:01,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:01,350 INFO L388 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 29 treesize of output 29 [2022-01-28 13:46:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:02,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:02,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-28 13:46:02,016 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:46:02,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 30 [2022-01-28 13:46:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:46:02,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:46:02,900 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1646 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:46:02,960 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1646 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:46:03,123 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1646 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:46:03,142 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (forall ((v_ArrVal_1646 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:46:03,165 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))) (forall ((v_ArrVal_1646 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3)))))))) is different from false [2022-01-28 13:46:03,179 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1646 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1646 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1646) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:46:03,220 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:46:03,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-01-28 13:46:03,228 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:46:03,228 INFO L388 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 79 treesize of output 66 [2022-01-28 13:46:03,234 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:46:03,235 INFO L388 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 66 treesize of output 53 [2022-01-28 13:46:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-28 13:46:05,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403841773] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:46:05,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:46:05,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 104 [2022-01-28 13:46:05,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692276998] [2022-01-28 13:46:05,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:46:05,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-01-28 13:46:05,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:46:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-01-28 13:46:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=8619, Unknown=64, NotChecked=1182, Total=10712 [2022-01-28 13:46:05,415 INFO L87 Difference]: Start difference. First operand 5119 states and 13206 transitions. Second operand has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:46:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:46:13,079 INFO L93 Difference]: Finished difference Result 9581 states and 25064 transitions. [2022-01-28 13:46:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-01-28 13:46:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 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 139 [2022-01-28 13:46:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:46:13,096 INFO L225 Difference]: With dead ends: 9581 [2022-01-28 13:46:13,096 INFO L226 Difference]: Without dead ends: 9411 [2022-01-28 13:46:13,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 215 SyntacticMatches, 19 SemanticMatches, 184 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 12095 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=3142, Invalid=29020, Unknown=82, NotChecked=2166, Total=34410 [2022-01-28 13:46:13,124 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 2468 mSDsluCounter, 11286 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 10859 SdHoareTripleChecker+Invalid, 9017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4985 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-28 13:46:13,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2468 Valid, 10859 Invalid, 9017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 3818 Invalid, 0 Unknown, 4985 Unchecked, 1.4s Time] [2022-01-28 13:46:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2022-01-28 13:46:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 5349. [2022-01-28 13:46:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5349 states, 5348 states have (on average 2.5790949887808527) internal successors, (13793), 5348 states have internal predecessors, (13793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:46:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 13793 transitions. [2022-01-28 13:46:13,225 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 13793 transitions. Word has length 139 [2022-01-28 13:46:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:46:13,225 INFO L470 AbstractCegarLoop]: Abstraction has 5349 states and 13793 transitions. [2022-01-28 13:46:13,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 3.375) internal successors, (351), 104 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:46:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 13793 transitions. [2022-01-28 13:46:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:46:13,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:46:13,231 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:46:13,248 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-01-28 13:46:13,432 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,SelfDestructingSolverStorable53 [2022-01-28 13:46:13,433 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:46:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:46:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash 742120390, now seen corresponding path program 47 times [2022-01-28 13:46:13,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:46:13,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827935034] [2022-01-28 13:46:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:46:13,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:46:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:46:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:46:14,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:46:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827935034] [2022-01-28 13:46:14,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827935034] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:46:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746774160] [2022-01-28 13:46:14,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:46:14,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:46:14,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:46:14,892 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-01-28 13:46:14,893 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-01-28 13:46:15,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:46:15,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:46:15,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-28 13:46:15,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:46:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:46:16,414 INFO L388 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 30 treesize of output 30 [2022-01-28 13:46:17,203 INFO L354 Elim1Store]: treesize reduction 166, result has 4.0 percent of original size [2022-01-28 13:46:17,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 21 [2022-01-28 13:46:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-28 13:46:17,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:46:18,826 INFO L354 Elim1Store]: treesize reduction 106, result has 38.7 percent of original size [2022-01-28 13:46:18,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 173 treesize of output 179 [2022-01-28 13:46:18,833 INFO L354 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-01-28 13:46:18,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 72 [2022-01-28 13:46:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:46:20,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746774160] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:46:20,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:46:20,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 32, 28] total 89 [2022-01-28 13:46:20,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119902301] [2022-01-28 13:46:20,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:46:20,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-01-28 13:46:20,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:46:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-01-28 13:46:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=7195, Unknown=4, NotChecked=0, Total=7832 [2022-01-28 13:46:20,904 INFO L87 Difference]: Start difference. First operand 5349 states and 13793 transitions. Second operand has 89 states, 89 states have (on average 3.797752808988764) internal successors, (338), 89 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-01-28 13:46:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:46:47,560 INFO L93 Difference]: Finished difference Result 11027 states and 28997 transitions. [2022-01-28 13:46:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-01-28 13:46:47,560 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.797752808988764) internal successors, (338), 89 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 139 [2022-01-28 13:46:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:46:47,577 INFO L225 Difference]: With dead ends: 11027 [2022-01-28 13:46:47,577 INFO L226 Difference]: Without dead ends: 10420 [2022-01-28 13:46:47,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 283 SyntacticMatches, 27 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33180 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=6513, Invalid=80800, Unknown=7, NotChecked=0, Total=87320 [2022-01-28 13:46:47,582 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 3789 mSDsluCounter, 13374 mSDsCounter, 0 mSdLazyCounter, 5958 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3789 SdHoareTripleChecker+Valid, 12335 SdHoareTripleChecker+Invalid, 15435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 5958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8973 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-28 13:46:47,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3789 Valid, 12335 Invalid, 15435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 5958 Invalid, 0 Unknown, 8973 Unchecked, 2.7s Time] [2022-01-28 13:46:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10420 states. [2022-01-28 13:46:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10420 to 5695. [2022-01-28 13:46:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 5694 states have (on average 2.5916754478398314) internal successors, (14757), 5694 states have internal predecessors, (14757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:46:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 14757 transitions. [2022-01-28 13:46:47,693 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 14757 transitions. Word has length 139 [2022-01-28 13:46:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:46:47,693 INFO L470 AbstractCegarLoop]: Abstraction has 5695 states and 14757 transitions. [2022-01-28 13:46:47,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.797752808988764) internal successors, (338), 89 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-01-28 13:46:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 14757 transitions. [2022-01-28 13:46:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:46:47,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:46:47,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:46:47,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-01-28 13:46:47,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:46:47,925 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:46:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:46:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2002152766, now seen corresponding path program 48 times [2022-01-28 13:46:47,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:46:47,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087092979] [2022-01-28 13:46:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:46:47,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:46:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:46:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:46:49,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:46:49,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087092979] [2022-01-28 13:46:49,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087092979] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:46:49,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705386505] [2022-01-28 13:46:49,263 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:46:49,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:46:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:46:49,265 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-01-28 13:46:49,265 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-01-28 13:46:49,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-28 13:46:49,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:46:49,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-28 13:46:49,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:46:49,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:46:49,985 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:46:49,986 INFO L388 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-01-28 13:46:50,138 INFO L388 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-01-28 13:46:50,261 INFO L388 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-01-28 13:46:50,394 INFO L388 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-01-28 13:46:50,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:46:51,523 INFO L388 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 29 treesize of output 29 [2022-01-28 13:46:52,088 INFO L354 Elim1Store]: treesize reduction 61, result has 39.0 percent of original size [2022-01-28 13:46:52,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 51 [2022-01-28 13:46:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:46:52,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:46:52,839 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1720 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1720 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)))))) is different from false [2022-01-28 13:46:52,890 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (and (forall ((v_ArrVal_1720 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1720 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)))))) is different from false [2022-01-28 13:46:52,900 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~q_back~0 c_~q_front~0) (<= c_~n~0 c_~q_back~0) (< c_~q_front~0 0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (and (forall ((v_ArrVal_1720 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)) c_~N~0)) (forall ((v_ArrVal_1720 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1720) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)))))) is different from false [2022-01-28 13:47:06,187 INFO L354 Elim1Store]: treesize reduction 96, result has 39.6 percent of original size [2022-01-28 13:47:06,187 INFO L388 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 3 case distinctions, treesize of input 258 treesize of output 164 [2022-01-28 13:47:06,370 INFO L354 Elim1Store]: treesize reduction 104, result has 69.7 percent of original size [2022-01-28 13:47:06,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 588 treesize of output 718 [2022-01-28 13:47:06,418 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:47:06,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 718 treesize of output 706 [2022-01-28 13:47:06,449 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:47:06,449 INFO L388 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 341 treesize of output 289 [2022-01-28 13:47:06,469 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:47:06,469 INFO L388 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 289 treesize of output 237 [2022-01-28 13:47:27,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:47:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-28 13:47:27,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705386505] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:47:27,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:47:27,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 42] total 112 [2022-01-28 13:47:27,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472531885] [2022-01-28 13:47:27,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:47:27,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-01-28 13:47:27,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:47:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-01-28 13:47:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=10659, Unknown=109, NotChecked=648, Total=12432 [2022-01-28 13:47:27,127 INFO L87 Difference]: Start difference. First operand 5695 states and 14757 transitions. Second operand has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:47:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:47:38,463 INFO L93 Difference]: Finished difference Result 7788 states and 19852 transitions. [2022-01-28 13:47:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-28 13:47:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 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 139 [2022-01-28 13:47:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:47:38,475 INFO L225 Difference]: With dead ends: 7788 [2022-01-28 13:47:38,475 INFO L226 Difference]: Without dead ends: 7632 [2022-01-28 13:47:38,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 226 SyntacticMatches, 19 SemanticMatches, 182 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11180 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=3290, Invalid=29190, Unknown=112, NotChecked=1080, Total=33672 [2022-01-28 13:47:38,478 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 3233 mSDsluCounter, 14190 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3233 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 9325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5573 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:47:38,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3233 Valid, 12942 Invalid, 9325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3590 Invalid, 0 Unknown, 5573 Unchecked, 1.6s Time] [2022-01-28 13:47:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2022-01-28 13:47:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 5910. [2022-01-28 13:47:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5910 states, 5909 states have (on average 2.5891013707903197) internal successors, (15299), 5909 states have internal predecessors, (15299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:47:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5910 states to 5910 states and 15299 transitions. [2022-01-28 13:47:38,619 INFO L78 Accepts]: Start accepts. Automaton has 5910 states and 15299 transitions. Word has length 139 [2022-01-28 13:47:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:47:38,620 INFO L470 AbstractCegarLoop]: Abstraction has 5910 states and 15299 transitions. [2022-01-28 13:47:38,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 3.25) internal successors, (364), 112 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:47:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5910 states and 15299 transitions. [2022-01-28 13:47:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:47:38,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:47:38,627 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:47:38,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-01-28 13:47:38,844 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,SelfDestructingSolverStorable55 [2022-01-28 13:47:38,844 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:47:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:47:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1055749540, now seen corresponding path program 49 times [2022-01-28 13:47:38,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:47:38,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184614002] [2022-01-28 13:47:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:47:38,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:47:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:47:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:47:40,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:47:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184614002] [2022-01-28 13:47:40,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184614002] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:47:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863443019] [2022-01-28 13:47:40,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-28 13:47:40,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:47:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:47:40,366 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-01-28 13:47:40,367 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-01-28 13:47:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:47:40,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-28 13:47:40,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:47:40,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:47:40,848 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:47:40,848 INFO L388 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-01-28 13:47:42,361 INFO L388 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 29 treesize of output 29 [2022-01-28 13:47:42,902 INFO L354 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-01-28 13:47:42,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 25 [2022-01-28 13:47:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:47:43,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:47:44,770 INFO L354 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-01-28 13:47:44,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 162 [2022-01-28 13:47:44,778 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:47:44,778 INFO L388 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 94 treesize of output 61 [2022-01-28 13:47:48,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:47:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:47:48,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863443019] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:47:48,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:47:48,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 108 [2022-01-28 13:47:48,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626665648] [2022-01-28 13:47:48,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:47:48,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:47:48,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:47:48,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:47:48,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=874, Invalid=10676, Unknown=6, NotChecked=0, Total=11556 [2022-01-28 13:47:48,732 INFO L87 Difference]: Start difference. First operand 5910 states and 15299 transitions. Second operand has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:48:03,119 INFO L93 Difference]: Finished difference Result 8338 states and 21716 transitions. [2022-01-28 13:48:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-01-28 13:48:03,119 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 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 139 [2022-01-28 13:48:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:48:03,130 INFO L225 Difference]: With dead ends: 8338 [2022-01-28 13:48:03,130 INFO L226 Difference]: Without dead ends: 8196 [2022-01-28 13:48:03,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 237 SyntacticMatches, 25 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13203 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3613, Invalid=33809, Unknown=20, NotChecked=0, Total=37442 [2022-01-28 13:48:03,132 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 3267 mSDsluCounter, 12443 mSDsCounter, 0 mSdLazyCounter, 4731 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3267 SdHoareTripleChecker+Valid, 11667 SdHoareTripleChecker+Invalid, 8426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 4731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3361 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-28 13:48:03,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3267 Valid, 11667 Invalid, 8426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 4731 Invalid, 0 Unknown, 3361 Unchecked, 2.0s Time] [2022-01-28 13:48:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2022-01-28 13:48:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 5977. [2022-01-28 13:48:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 2.5893574297188753) internal successors, (15474), 5976 states have internal predecessors, (15474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 15474 transitions. [2022-01-28 13:48:03,222 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 15474 transitions. Word has length 139 [2022-01-28 13:48:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:48:03,222 INFO L470 AbstractCegarLoop]: Abstraction has 5977 states and 15474 transitions. [2022-01-28 13:48:03,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 15474 transitions. [2022-01-28 13:48:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:48:03,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:48:03,229 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:48:03,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-01-28 13:48:03,442 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,SelfDestructingSolverStorable56 [2022-01-28 13:48:03,443 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:48:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:48:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1543528002, now seen corresponding path program 50 times [2022-01-28 13:48:03,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:48:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637294518] [2022-01-28 13:48:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:48:03,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:48:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:48:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:48:04,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:48:04,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637294518] [2022-01-28 13:48:04,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637294518] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:48:04,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588119695] [2022-01-28 13:48:04,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:48:04,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:48:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:48:04,543 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:48:04,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-01-28 13:48:04,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:48:04,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:48:04,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-28 13:48:04,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:48:04,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:48:04,935 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:48:04,935 INFO L388 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-01-28 13:48:06,258 INFO L388 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 30 treesize of output 30 [2022-01-28 13:48:06,799 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:48:06,799 INFO L388 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 47 treesize of output 13 [2022-01-28 13:48:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:48:06,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:48:07,408 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:48:07,455 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) c_~N~0))) (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:48:07,465 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 c_~q_back~0) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:48:07,479 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) c_~N~0))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0)) is different from false [2022-01-28 13:48:07,495 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-01-28 13:48:07,516 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))))) is different from false [2022-01-28 13:48:07,527 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)))))) is different from false [2022-01-28 13:48:07,553 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:48:07,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:48:07,558 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:48:07,558 INFO L388 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 79 treesize of output 66 [2022-01-28 13:48:07,562 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:48:07,562 INFO L388 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 66 treesize of output 53 [2022-01-28 13:48:09,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:48:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-28 13:48:09,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588119695] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:48:09,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:48:09,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 106 [2022-01-28 13:48:09,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968950683] [2022-01-28 13:48:09,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:48:09,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-01-28 13:48:09,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:48:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-01-28 13:48:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=8906, Unknown=7, NotChecked=1400, Total=11130 [2022-01-28 13:48:09,635 INFO L87 Difference]: Start difference. First operand 5977 states and 15474 transitions. Second operand has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:17,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 0 c_~s~0)) (.cse4 (= (* 4 c_~q_back~0) (* 4 c_~q_front~0))) (.cse5 (<= c_~s~0 0)) (.cse0 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (< c_~q_back~0 0)) (.cse2 (<= c_~n~0 (+ 2 c_~q_back~0)))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (or .cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_162| Int)) (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_162|))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_162|) 0)))) .cse1 .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse1 .cse2) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse7 (* c_~q_front~0 4))) (+ (select .cse6 (+ c_~q~0.offset .cse7)) (select .cse6 (+ c_~q~0.offset 4 .cse7)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse9 (* c_~q_front~0 4))) (+ (select .cse8 (+ c_~q~0.offset .cse9)) (select .cse8 (+ c_~q~0.offset 4 .cse9)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2))))) (or (and .cse3 .cse4 .cse5 (not (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0 .cse1 .cse2) (= c_~s~0 0))) is different from false [2022-01-28 13:48:25,708 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1)) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0))))))) is different from false [2022-01-28 13:48:26,841 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_1788 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset .cse1)) (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0)))) (forall ((v_ArrVal_1788 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1788) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset .cse3)) (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0)) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))) (<= c_~n~0 (+ c_~q_back~0 1)))) is different from false [2022-01-28 13:48:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:48:30,697 INFO L93 Difference]: Finished difference Result 11563 states and 29987 transitions. [2022-01-28 13:48:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2022-01-28 13:48:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 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 139 [2022-01-28 13:48:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:48:30,720 INFO L225 Difference]: With dead ends: 11563 [2022-01-28 13:48:30,720 INFO L226 Difference]: Without dead ends: 10990 [2022-01-28 13:48:30,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 214 SyntacticMatches, 30 SemanticMatches, 239 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 17704 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=5753, Invalid=47263, Unknown=154, NotChecked=4670, Total=57840 [2022-01-28 13:48:30,722 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 4606 mSDsluCounter, 12406 mSDsCounter, 0 mSdLazyCounter, 7403 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 11506 SdHoareTripleChecker+Invalid, 15257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 7403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7226 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:48:30,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4606 Valid, 11506 Invalid, 15257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 7403 Invalid, 0 Unknown, 7226 Unchecked, 3.1s Time] [2022-01-28 13:48:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10990 states. [2022-01-28 13:48:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10990 to 5745. [2022-01-28 13:48:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 5744 states have (on average 2.5870473537604455) internal successors, (14860), 5744 states have internal predecessors, (14860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 14860 transitions. [2022-01-28 13:48:30,818 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 14860 transitions. Word has length 139 [2022-01-28 13:48:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:48:30,818 INFO L470 AbstractCegarLoop]: Abstraction has 5745 states and 14860 transitions. [2022-01-28 13:48:30,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 3.4245283018867925) internal successors, (363), 106 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:48:30,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 14860 transitions. [2022-01-28 13:48:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:48:30,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:48:30,825 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:48:30,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-01-28 13:48:31,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:48:31,039 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:48:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:48:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1672261106, now seen corresponding path program 51 times [2022-01-28 13:48:31,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:48:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98472630] [2022-01-28 13:48:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:48:31,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:48:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:48:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:48:32,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:48:32,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98472630] [2022-01-28 13:48:32,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98472630] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:48:32,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969459595] [2022-01-28 13:48:32,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-28 13:48:32,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:48:32,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:48:32,482 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:48:32,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-01-28 13:48:32,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-28 13:48:32,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:48:32,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-28 13:48:32,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:48:32,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:48:32,934 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:48:32,934 INFO L388 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-01-28 13:48:33,544 INFO L388 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 30 treesize of output 30 [2022-01-28 13:48:33,730 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:48:33,731 INFO L388 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 47 treesize of output 13 [2022-01-28 13:48:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:48:33,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:48:34,816 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:48:34,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 162 [2022-01-28 13:48:34,821 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:48:34,822 INFO L388 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 94 treesize of output 61 [2022-01-28 13:48:35,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:48:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-28 13:48:35,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969459595] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:48:35,458 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:48:35,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28, 28] total 82 [2022-01-28 13:48:35,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524402261] [2022-01-28 13:48:35,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:48:35,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-28 13:48:35,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:48:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-28 13:48:35,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=6344, Unknown=6, NotChecked=0, Total=6642 [2022-01-28 13:48:35,468 INFO L87 Difference]: Start difference. First operand 5745 states and 14860 transitions. Second operand has 82 states, 82 states have (on average 3.768292682926829) internal successors, (309), 82 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-01-28 13:49:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:49:02,692 INFO L93 Difference]: Finished difference Result 11867 states and 30520 transitions. [2022-01-28 13:49:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2022-01-28 13:49:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 3.768292682926829) internal successors, (309), 82 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 139 [2022-01-28 13:49:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:49:02,709 INFO L225 Difference]: With dead ends: 11867 [2022-01-28 13:49:02,710 INFO L226 Difference]: Without dead ends: 11429 [2022-01-28 13:49:02,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 247 SyntacticMatches, 39 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26544 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=5314, Invalid=65702, Unknown=6, NotChecked=0, Total=71022 [2022-01-28 13:49:02,712 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 4984 mSDsluCounter, 15534 mSDsCounter, 0 mSdLazyCounter, 9591 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 14506 SdHoareTripleChecker+Invalid, 12216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 9591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1839 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:49:02,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4984 Valid, 14506 Invalid, 12216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 9591 Invalid, 0 Unknown, 1839 Unchecked, 4.1s Time] [2022-01-28 13:49:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2022-01-28 13:49:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 5558. [2022-01-28 13:49:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 5557 states have (on average 2.594565412992622) internal successors, (14418), 5557 states have internal predecessors, (14418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:49:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 14418 transitions. [2022-01-28 13:49:02,821 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 14418 transitions. Word has length 139 [2022-01-28 13:49:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:49:02,822 INFO L470 AbstractCegarLoop]: Abstraction has 5558 states and 14418 transitions. [2022-01-28 13:49:02,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.768292682926829) internal successors, (309), 82 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-01-28 13:49:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 14418 transitions. [2022-01-28 13:49:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:49:02,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:49:02,828 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:49:02,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-01-28 13:49:03,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:49:03,048 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:49:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:49:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1860045654, now seen corresponding path program 52 times [2022-01-28 13:49:03,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:49:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945708760] [2022-01-28 13:49:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:49:03,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:49:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:49:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:49:05,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:49:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945708760] [2022-01-28 13:49:05,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945708760] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:49:05,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709105184] [2022-01-28 13:49:05,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-28 13:49:05,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:49:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:49:05,358 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:49:05,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-01-28 13:49:05,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-28 13:49:05,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:49:05,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-28 13:49:05,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:49:07,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:49:07,548 INFO L388 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 31 treesize of output 31 [2022-01-28 13:49:08,221 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:49:08,222 INFO L388 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 47 treesize of output 13 [2022-01-28 13:49:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:49:08,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:49:09,072 WARN L838 $PredicateComparison]: unable to prove that (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1855 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (< c_~q_back~0 0)) is different from false [2022-01-28 13:49:09,143 WARN L838 $PredicateComparison]: unable to prove that (or (< (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 1) c_~N~0) (<= c_~n~0 c_~q_back~0) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1855 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (< c_~q_back~0 0)) is different from false [2022-01-28 13:49:09,158 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~q_back~0) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ (select .cse0 (+ c_~q~0.offset 4 .cse1)) c_~s~0 (select .cse0 (+ c_~q~0.offset .cse1)))) c_~N~0)) (forall ((v_ArrVal_1855 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse3)) c_~s~0 (select .cse2 (+ c_~q~0.offset .cse3))))))) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0) (< c_~q_back~0 0)) is different from false [2022-01-28 13:49:09,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))) c_~N~0)) (forall ((v_ArrVal_1855 (Array Int Int))) (<= c_~N~0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4))))))) (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) c_~N~0))) is different from false [2022-01-28 13:49:09,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (<= c_~n~0 .cse0) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4))))))))) is different from false [2022-01-28 13:49:09,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) (<= c_~n~0 .cse0))) is different from false [2022-01-28 13:49:09,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4))))))) (<= c_~n~0 .cse0))) is different from false [2022-01-28 13:49:09,279 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:49:09,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-01-28 13:49:09,285 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:49:09,285 INFO L388 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 79 treesize of output 66 [2022-01-28 13:49:09,290 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:49:09,290 INFO L388 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 66 treesize of output 53 [2022-01-28 13:49:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-28 13:49:11,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709105184] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:49:11,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:49:11,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 38, 38] total 111 [2022-01-28 13:49:11,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974403352] [2022-01-28 13:49:11,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:49:11,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-01-28 13:49:11,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:49:11,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-01-28 13:49:11,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=9916, Unknown=7, NotChecked=1470, Total=12210 [2022-01-28 13:49:11,304 INFO L87 Difference]: Start difference. First operand 5558 states and 14418 transitions. Second operand has 111 states, 111 states have (on average 3.279279279279279) internal successors, (364), 111 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:49:17,528 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 c_~s~0)) (.cse1 (= (* 4 c_~q_back~0) (* 4 c_~q_front~0))) (.cse2 (<= c_~s~0 0))) (let ((.cse6 (+ |c_#StackHeapBarrier| 1)) (.cse9 (select |c_#memory_int| c_~q~0.base)) (.cse3 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse7 (and .cse0 .cse1 .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse4 (< c_~q_back~0 0)) (.cse5 (<= c_~n~0 (+ 2 c_~q_back~0)))) (and (or (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse3 .cse4 .cse5) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse7 (<= 1 c_~q_back~0) .cse4) (let ((.cse8 (+ c_~q_back~0 1))) (or (< .cse8 0) (not (= (select .cse9 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse11 (* c_~q_front~0 4))) (+ (select .cse10 (+ c_~q~0.offset 4 .cse11)) c_~s~0 (select .cse10 (+ c_~q~0.offset .cse11)))))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse13 (* c_~q_front~0 4))) (+ (select .cse12 (+ c_~q~0.offset 4 .cse13)) c_~s~0 (select .cse12 (+ c_~q~0.offset .cse13)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) (<= c_~n~0 .cse8))) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse7 .cse4 .cse5) (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (let ((.cse14 (let ((.cse15 (* c_~q_front~0 4))) (+ (select .cse9 (+ c_~q~0.offset 4 .cse15)) (select .cse9 (+ c_~q~0.offset .cse15)) c_~s~0)))) (and (<= .cse14 c_~N~0) (<= c_~N~0 .cse14))) (<= c_~n~0 c_~q_back~0) .cse4) (or .cse3 .cse4 .cse5 (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (= c_~s~0 0) (or .cse3 .cse7 .cse4 .cse5)))) is different from false [2022-01-28 13:49:20,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 0 c_~s~0)) (.cse1 (= (* 4 c_~q_back~0) (* 4 c_~q_front~0))) (.cse2 (<= c_~s~0 0))) (let ((.cse6 (+ |c_#StackHeapBarrier| 1)) (.cse3 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse7 (and .cse0 .cse1 .cse2 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (.cse4 (< c_~q_back~0 0)) (.cse5 (<= c_~n~0 (+ 2 c_~q_back~0)))) (and (or (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse3 .cse4 .cse5) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse7 (<= 1 c_~q_back~0) .cse4) (let ((.cse8 (+ c_~q_back~0 1))) (or (< .cse8 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse10 (* c_~q_front~0 4))) (+ (select .cse9 (+ c_~q~0.offset 4 .cse10)) c_~s~0 (select .cse9 (+ c_~q~0.offset .cse10)))))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse12 (* c_~q_front~0 4))) (+ (select .cse11 (+ c_~q~0.offset 4 .cse12)) c_~s~0 (select .cse11 (+ c_~q~0.offset .cse12)))) (+ |c_thread1Thread1of1ForFork1_#t~post1#1| 2)))) (<= c_~n~0 .cse8))) (or (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse7 .cse4 .cse5) (or .cse3 .cse4 .cse5 (and .cse0 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) (= c_~s~0 0) (or .cse3 .cse7 .cse4 .cse5)))) is different from false [2022-01-28 13:49:27,224 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~q~0.base)) (.cse0 (< c_~q_back~0 0))) (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) .cse0) (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (let ((.cse1 (+ c_~q_back~0 1))) (or (< .cse1 0) (not (= (select .cse2 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse6 (* c_~q_front~0 4))) (+ (select .cse5 (+ c_~q~0.offset 4 .cse6)) c_~s~0 (select .cse5 (+ c_~q~0.offset .cse6))))))) (<= c_~n~0 .cse1))) (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (let ((.cse7 (let ((.cse8 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse8)) (select .cse2 (+ c_~q~0.offset .cse8)) c_~s~0)))) (and (<= .cse7 c_~N~0) (<= c_~N~0 .cse7))) (<= c_~n~0 c_~q_back~0) .cse0))) is different from false [2022-01-28 13:49:27,677 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (or (and (<= c_~N~0 c_~s~0) (<= c_~s~0 c_~N~0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| 0))) (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4))))))) (<= c_~n~0 .cse0)))) is different from false [2022-01-28 13:49:29,241 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) (< c_~q_back~0 0)) (let ((.cse0 (+ c_~q_back~0 1))) (or (< .cse0 0) (not (= (select (select |c_#memory_int| c_~q~0.base) (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse2 (* c_~q_front~0 4))) (+ (select .cse1 (+ c_~q~0.offset 4 .cse2)) c_~s~0 (select .cse1 (+ c_~q~0.offset .cse2)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4))))))) (<= c_~n~0 .cse0)))) is different from false [2022-01-28 13:49:29,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~q~0.base)) (.cse0 (< c_~q_back~0 0))) (and (or (and (<= 0 c_~s~0) (= (* 4 c_~q_back~0) (* 4 c_~q_front~0)) (<= c_~s~0 0) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= 1 c_~q_back~0) .cse0) (let ((.cse1 (+ c_~q_back~0 1))) (or (< .cse1 0) (not (= (select .cse2 (+ (* c_~q_back~0 4) c_~q~0.offset)) 1)) (and (forall ((v_ArrVal_1855 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (+ (select .cse3 (+ c_~q~0.offset 4 .cse4)) c_~s~0 (select .cse3 (+ c_~q~0.offset .cse4)))) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))) (forall ((v_ArrVal_1855 (Array Int Int))) (<= (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1855) c_~q~0.base)) (.cse6 (* c_~q_front~0 4))) (+ (select .cse5 (+ c_~q~0.offset 4 .cse6)) c_~s~0 (select .cse5 (+ c_~q~0.offset .cse6))))))) (<= c_~n~0 .cse1))) (or (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (let ((.cse7 (let ((.cse8 (* c_~q_front~0 4))) (+ (select .cse2 (+ c_~q~0.offset 4 .cse8)) (select .cse2 (+ c_~q~0.offset .cse8)) c_~s~0)))) (and (<= .cse7 c_~N~0) (<= c_~N~0 .cse7))) (<= c_~n~0 c_~q_back~0) .cse0))) is different from false [2022-01-28 13:49:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:49:31,827 INFO L93 Difference]: Finished difference Result 11688 states and 30571 transitions. [2022-01-28 13:49:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-01-28 13:49:31,827 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 3.279279279279279) internal successors, (364), 111 states have internal predecessors, (364), 0 states have call successors, (0), 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 139 [2022-01-28 13:49:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:49:31,845 INFO L225 Difference]: With dead ends: 11688 [2022-01-28 13:49:31,845 INFO L226 Difference]: Without dead ends: 11586 [2022-01-28 13:49:31,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 211 SyntacticMatches, 22 SemanticMatches, 227 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 14231 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=4681, Invalid=41767, Unknown=44, NotChecked=5720, Total=52212 [2022-01-28 13:49:31,848 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 4238 mSDsluCounter, 12287 mSDsCounter, 0 mSdLazyCounter, 7860 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4238 SdHoareTripleChecker+Valid, 11404 SdHoareTripleChecker+Invalid, 12389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 7860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3952 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-01-28 13:49:31,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4238 Valid, 11404 Invalid, 12389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 7860 Invalid, 0 Unknown, 3952 Unchecked, 3.9s Time] [2022-01-28 13:49:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-01-28 13:49:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 5482. [2022-01-28 13:49:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5482 states, 5481 states have (on average 2.59514687100894) internal successors, (14224), 5481 states have internal predecessors, (14224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:49:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5482 states to 5482 states and 14224 transitions. [2022-01-28 13:49:31,966 INFO L78 Accepts]: Start accepts. Automaton has 5482 states and 14224 transitions. Word has length 139 [2022-01-28 13:49:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:49:31,966 INFO L470 AbstractCegarLoop]: Abstraction has 5482 states and 14224 transitions. [2022-01-28 13:49:31,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.279279279279279) internal successors, (364), 111 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:49:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5482 states and 14224 transitions. [2022-01-28 13:49:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:49:31,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:49:31,973 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:49:31,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-01-28 13:49:32,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-01-28 13:49:32,187 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:49:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:49:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 865237478, now seen corresponding path program 53 times [2022-01-28 13:49:32,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:49:32,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481614936] [2022-01-28 13:49:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:49:32,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:49:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:49:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:49:33,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:49:33,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481614936] [2022-01-28 13:49:33,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481614936] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:49:33,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980241425] [2022-01-28 13:49:33,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-28 13:49:33,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:49:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:49:33,837 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:49:33,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-01-28 13:49:34,016 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-28 13:49:34,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:49:34,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 90 conjunts are in the unsatisfiable core [2022-01-28 13:49:34,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:49:34,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:49:34,352 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:49:34,352 INFO L388 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-01-28 13:49:35,828 INFO L388 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 30 treesize of output 30 [2022-01-28 13:49:36,246 INFO L354 Elim1Store]: treesize reduction 52, result has 5.5 percent of original size [2022-01-28 13:49:36,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 16 [2022-01-28 13:49:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:49:36,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:49:38,191 INFO L354 Elim1Store]: treesize reduction 61, result has 39.0 percent of original size [2022-01-28 13:49:38,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 145 [2022-01-28 13:49:38,197 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-28 13:49:38,198 INFO L388 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 91 treesize of output 61 [2022-01-28 13:49:41,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:49:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:49:41,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980241425] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:49:41,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:49:41,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 108 [2022-01-28 13:49:41,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104659964] [2022-01-28 13:49:41,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:49:41,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:49:41,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:49:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:49:41,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=10189, Unknown=6, NotChecked=0, Total=11556 [2022-01-28 13:49:41,051 INFO L87 Difference]: Start difference. First operand 5482 states and 14224 transitions. Second operand has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:50:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:50:14,041 INFO L93 Difference]: Finished difference Result 10426 states and 26737 transitions. [2022-01-28 13:50:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-01-28 13:50:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 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 139 [2022-01-28 13:50:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:50:14,056 INFO L225 Difference]: With dead ends: 10426 [2022-01-28 13:50:14,056 INFO L226 Difference]: Without dead ends: 9984 [2022-01-28 13:50:14,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 234 SyntacticMatches, 19 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20172 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=6316, Invalid=51958, Unknown=48, NotChecked=0, Total=58322 [2022-01-28 13:50:14,058 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 4437 mSDsluCounter, 13480 mSDsCounter, 0 mSdLazyCounter, 5957 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 12596 SdHoareTripleChecker+Invalid, 10217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 5957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3949 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-28 13:50:14,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4437 Valid, 12596 Invalid, 10217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 5957 Invalid, 0 Unknown, 3949 Unchecked, 2.6s Time] [2022-01-28 13:50:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9984 states. [2022-01-28 13:50:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9984 to 5654. [2022-01-28 13:50:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5654 states, 5653 states have (on average 2.6000353794445425) internal successors, (14698), 5653 states have internal predecessors, (14698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:50:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5654 states to 5654 states and 14698 transitions. [2022-01-28 13:50:14,160 INFO L78 Accepts]: Start accepts. Automaton has 5654 states and 14698 transitions. Word has length 139 [2022-01-28 13:50:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:50:14,160 INFO L470 AbstractCegarLoop]: Abstraction has 5654 states and 14698 transitions. [2022-01-28 13:50:14,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 13:50:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5654 states and 14698 transitions. [2022-01-28 13:50:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-28 13:50:14,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:50:14,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-28 13:50:14,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-01-28 13:50:14,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:50:14,380 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-28 13:50:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:50:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1239032034, now seen corresponding path program 54 times [2022-01-28 13:50:14,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:50:14,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603459577] [2022-01-28 13:50:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:50:14,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:50:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:50:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:50:15,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:50:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603459577] [2022-01-28 13:50:15,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603459577] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:50:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944430746] [2022-01-28 13:50:15,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-28 13:50:15,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:50:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:50:15,701 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:50:15,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-01-28 13:50:15,860 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-28 13:50:15,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:50:15,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 90 conjunts are in the unsatisfiable core [2022-01-28 13:50:15,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:50:15,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:50:16,150 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-28 13:50:16,151 INFO L388 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-01-28 13:50:17,749 INFO L388 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 30 treesize of output 30 [2022-01-28 13:50:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:50:18,429 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:50:18,429 INFO L388 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 41 treesize of output 13 [2022-01-28 13:50:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:50:18,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:50:20,067 INFO L354 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-01-28 13:50:20,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 161 [2022-01-28 13:50:20,073 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-28 13:50:20,073 INFO L388 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 93 treesize of output 61 [2022-01-28 13:50:22,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-28 13:50:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:50:22,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944430746] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:50:22,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:50:22,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 108 [2022-01-28 13:50:22,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862530003] [2022-01-28 13:50:22,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:50:22,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-01-28 13:50:22,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:50:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-01-28 13:50:22,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1067, Invalid=10483, Unknown=6, NotChecked=0, Total=11556 [2022-01-28 13:50:22,750 INFO L87 Difference]: Start difference. First operand 5654 states and 14698 transitions. Second operand has 108 states, 108 states have (on average 3.361111111111111) internal successors, (363), 108 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-01-28 13:50:32,197 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-28 13:50:32,197 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-28 13:50:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-01-28 13:50:32,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 220 SyntacticMatches, 6 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13048 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=4475, Invalid=36518, Unknown=13, NotChecked=0, Total=41006 [2022-01-28 13:50:32,205 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 2067 mSDsluCounter, 6530 mSDsCounter, 0 mSdLazyCounter, 3071 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 6281 SdHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:50:32,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2067 Valid, 6281 Invalid, 4068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3071 Invalid, 0 Unknown, 803 Unchecked, 1.2s Time] [2022-01-28 13:50:32,206 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-28 13:50:32,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-01-28 13:50:32,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-01-28 13:50:32,413 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (5654states) and FLOYD_HOARE automaton (currently 107 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (694 states constructed, input type IntersectNwa). [2022-01-28 13:50:32,415 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-28 13:50:32,415 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-28 13:50:32,416 INFO L732 BasicCegarLoop]: Path program histogram: [54, 3, 2, 1, 1, 1] [2022-01-28 13:50:32,418 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 13:50:32,418 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 13:50:32,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 01:50:32 BasicIcfg [2022-01-28 13:50:32,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 13:50:32,419 INFO L158 Benchmark]: Toolchain (without parser) took 843268.36ms. Allocated memory was 177.2MB in the beginning and 836.8MB in the end (delta: 659.6MB). Free memory was 120.1MB in the beginning and 475.1MB in the end (delta: -354.9MB). Peak memory consumption was 304.8MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.85ms. Allocated memory was 177.2MB in the beginning and 278.9MB in the end (delta: 101.7MB). Free memory was 120.0MB in the beginning and 251.4MB in the end (delta: -131.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.54ms. Allocated memory is still 278.9MB. Free memory was 251.4MB in the beginning and 249.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 278.9MB. Free memory was 249.3MB in the beginning and 247.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: RCFGBuilder took 500.51ms. Allocated memory is still 278.9MB. Free memory was 247.7MB in the beginning and 227.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,419 INFO L158 Benchmark]: TraceAbstraction took 842458.76ms. Allocated memory was 278.9MB in the beginning and 836.8MB in the end (delta: 557.8MB). Free memory was 226.8MB in the beginning and 475.1MB in the end (delta: -248.3MB). Peak memory consumption was 309.5MB. Max. memory is 8.0GB. [2022-01-28 13:50:32,420 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.85ms. Allocated memory was 177.2MB in the beginning and 278.9MB in the end (delta: 101.7MB). Free memory was 120.0MB in the beginning and 251.4MB in the end (delta: -131.4MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.54ms. Allocated memory is still 278.9MB. Free memory was 251.4MB in the beginning and 249.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 278.9MB. Free memory was 249.3MB in the beginning and 247.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 500.51ms. Allocated memory is still 278.9MB. Free memory was 247.7MB in the beginning and 227.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 842458.76ms. Allocated memory was 278.9MB in the beginning and 836.8MB in the end (delta: 557.8MB). Free memory was 226.8MB in the beginning and 475.1MB in the end (delta: -248.3MB). Peak memory consumption was 309.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (5654states) and FLOYD_HOARE automaton (currently 107 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (694 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (5654states) and FLOYD_HOARE automaton (currently 107 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (694 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (5654states) and FLOYD_HOARE automaton (currently 107 states, 108 states before enhancement),while ReachableStatesComputation was computing reachable states (694 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 146 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 842.4s, OverallIterations: 62, TraceHistogramMax: 4, PathProgramHistogramMax: 54, EmptinessCheckTime: 0.3s, AutomataDifference: 490.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156354 SdHoareTripleChecker+Valid, 83.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156354 mSDsluCounter, 447313 SdHoareTripleChecker+Invalid, 71.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 116527 IncrementalHoareTripleChecker+Unchecked, 472080 mSDsCounter, 14202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209403 IncrementalHoareTripleChecker+Invalid, 340132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14202 mSolverCounterUnsat, 11748 mSDtfsCounter, 209403 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22632 GetRequests, 12863 SyntacticMatches, 721 SemanticMatches, 9048 ConstructedPredicates, 124 IntricatePredicates, 11 DeprecatedPredicates, 517002 ImplicationChecksByTransitivity, 537.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7470occurred in iteration=33, InterpolantAutomatonStates: 5102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 61 MinimizatonAttempts, 123527 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 325.5s InterpolantComputationTime, 15677 NumberOfCodeBlocks, 15488 NumberOfCodeBlocksAsserted, 195 NumberOfCheckSat, 23022 ConstructedInterpolants, 1795 QuantifiedInterpolants, 503167 SizeOfPredicates, 1909 NumberOfNonLiveVariables, 17539 ConjunctsInSsa, 3358 ConjunctsInUnsatCore, 177 InterpolantComputations, 5 PerfectInterpolantSequences, 980/5451 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown